Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • Relaxation methods for problem...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Relaxation methods for problems with strictly convex costs and linear inequality constraints

Relaxation methods for problems with strictly convex costs and linear inequality constraints

Cover title.

Bibliographic Details
Other Authors: Tseng, Paul.
Language:eng
Published: Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] 2003
Subjects:
TK7855.M41 E3845 no.1717
Online Access:http://hdl.handle.net/1721.1/3026
  • Holdings
  • Description
  • Similar Items
  • Staff View
Description
Summary:Cover title.

Similar Items

  • Relaxation methods for problems with strictly convex separable costs and linear constraints
    Published: (2003)
  • Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach
    Published: (2003)
  • An e-relaxation method for separable convex cost network flow problems
    Published: (2003)
  • E-relaxation and auction method for separable convex cost network flow problems
    Published: (2003)
  • An E-relaxation method for separable convex cost generalized network flow problems
    Published: (2003)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs