Primal-dual target-following algorithms for linear programming.
In: Annals of Operations Research, Jg. 62 (1996), Heft 1-4, S. 197-231
Online
academicJournal
Zugriff:
In this paper, we propose a method for linear programming with the property that, starting from an initial non-central point, it generates iterates that simultaneously get closer to optimality and closer to centrality. The iterates follow paths that in the limit are tangential to the central path. Together with the convergence analysis, we provide a general framework which enables us to analyze various primal-dual algorithms in the literature in a short and uniform way. [ABSTRACT FROM AUTHOR]
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
Primal-dual target-following algorithms for linear programming.
|
---|---|
Autor/in / Beteiligte Person: | Jansen, B. ; Roos, C. ; Terlaky, T. ; Vial, J.-Ph. |
Link: | |
Zeitschrift: | Annals of Operations Research, Jg. 62 (1996), Heft 1-4, S. 197-231 |
Veröffentlichung: | 1996 |
Medientyp: | academicJournal |
ISSN: | 0254-5330 (print) |
DOI: | 10.1007/BF02206817 |
Schlagwort: |
|
Sonstiges: |
|