A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming

Yaguang Yang ()
Additional contact information
Yaguang Yang: NRC

Journal of Optimization Theory and Applications, 2013, vol. 158, issue 3, No 11, 859-873

Abstract: Abstract In this paper, ellipsoidal estimations are used to track the central path of linear programming. A higher-order interior-point algorithm is devised to search the optimizers along the ellipse. The algorithm is proved to be polynomial with the best complexity bound for all polynomial algorithms and better than the best known bound for higher-order algorithms.

Keywords: Arc-search; Interior-point method; Polynomial algorithm; Linear programming (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-013-0281-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:joptap:v:158:y:2013:i:3:d:10.1007_s10957-013-0281-0

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-013-0281-0

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().