Journal
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume 158, Issue 3, Pages 859-873Publisher
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-013-0281-0
Keywords
Arc-search; Interior-point method; Polynomial algorithm; Linear programming
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available