ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

On the convergence of the exponential multiplier method for convex programming (1993)

Tseng, Paul ; Bertsekas, Dimitri P.

Springer

Mathematical programming 60 (1993), S. 1-19

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1436-4646

Schlagwort(e): Convex programming ; linear programming ; multiplier method ; exponential penalty ; Augmented Lagrangian

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik , Mathematik

Notizen: Abstract In this paper, we analyze the exponential method of multipliers for convex constrained minimization problems, which operates like the usual Augmented Lagrangian method, except that it uses an exponential penalty function in place of the usual quadratic. We also analyze a dual counterpart, the entropy minimization algorithm, which operates like the proximal minimization algorithm, except that it uses a logarithmic/entropy “proximal” term in place of a quadratic. We strengthen substantially the available convergence results for these methods, and we derive the convergence rate of these methods when applied to linear programs.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF01580598

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer