A nonconvex weighted potential function forpolynomial target following methods

E. de Klerk, C. Roos and T. Terlaky

Annals of Operations Research, 1998, vol. 81, issue 0, 3-14

Abstract: Long step interior-point methods in linear programming are some of the most efficientalgorithms from a computational point of view. We prove polynomial complexity of a classof long step target-following methods in a novel way, by introducing a new nonconvexpotential function and adapting the analysis framework of Jansen et al. [4, 6, 7]. The mainadvantage is that the new potential function has an obvious extension to semi-definiteprogramming, whereas the potential used in the above-mentioned papers does not. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018913325452 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:81:y:1998:i:0:p:3-14:10.1023/a:1018913325452

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018913325452

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().