A lower bound on the number of iterations of long-step primal-dual linear programming algorithms-Reference-Cited by-同舟云学术

A lower bound on the number of iterations of long-step primal-dual linear programming algorithms

Published:1996-12 Issue:1 Volume:62 Page:233-252
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Todd Michael J.,Ye Yinyu

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/BF02206818.pdf

Reference22 articles.

1. K.M. Anstreicher, On the performance of Karmarkar's algorithm over a sequence of iterations, SIAM J. Optim. 1(1991)22.

2. K.M. Anstreicher, J. Ji, F. Potra and Y. Ye, Average performance of a self-dual interior-point algorithm for linear programming, in:Complexity in Numerical Optimization, ed. P. Pardalos (World Scientific, New Jersey, 1993) p. 1.

3. D. Bertsimas and X. Luo, On the worst case complexity of potential reduction algorithms for linear programming, Working Paper 3558-93, Sloan School of Management, MIT, Cambridge, MA 02139, USA (1993).

4. D. Goldfarb and M.J. Todd, Linear programming, in:Optimization, Volume 1 ofHandbooks in Operations Research and Management Science, ed. G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (North-Holland, Amsterdam, The Netherlands, 1989) p. 73.

5. C.C. Gonzaga, Path following methods for linear programming, SIAM Rev. 34(1992)167.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Basics in Linear and Convex Optimization;Springer Optimization and Its Applications;2021

2. The Iteration-Complexity Upper Bound for the Mizuno-Todd-Ye Predictor-Corrector Algorithm is Tight;Modeling and Optimization: Theory and Applications;2019

3. Log-Barrier Interior Point Methods Are Not Strongly Polynomial;SIAM Journal on Applied Algebra and Geometry;2018-01

4. Bibliography;Interior Point Algorithms;2011-10-14

5. On Interior-Point Warmstarts for Linear and Combinatorial Optimization;SIAM Journal on Optimization;2010-01