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
  • Dual coordinate ascent for pro...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach

Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach

Caption title. "July 1988."

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

Internet

http://hdl.handle.net/1721.1/3069

Similar Items

  • Relaxation methods for problems with strictly convex separable costs and linear constraints
    Published: (2003)
  • Relaxation methods for problems with strictly convex costs and linear inequality constraints
    Published: (2003)
  • Dual coordinate ascent methods for linear network flow problems
    Published: (2003)
  • Forward path search : a new dual coordinate ascent algorithm for shortest paths
    Published: (2003)
  • Coordinate ascent for maximizing nondifferentiable concave functions
    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