On the worst case complexity of potential reduction algorithms for linear programming

Mathematical Programming, Series B

Volumn 77, Issue 2, 1997, Pages 321-333

  Bertsimas, Dimitris ^a   Luo, Xiaodong ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Interior point methods; Lower bounds on complexity; Potential reduction algorithms

Indexed keywords

EID: 77951500333     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. K.M. Anstreicher, The worst-case step in Karmarkar's algorithm, Mathematics of Operations Research 14 (1989) 295-302.
2. K.M. Anstreicher, On the performance of Karmarkar's algorithm over a sequence of iterations, SIAM Journal on Optimization 1 (1991) 22-29.
3. R. Freund, Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function, Mathematical Programming 51 (1991) 203-222.
4. 3L) operations, in: N. Megiddo, ed., Progress in Mathematical Programming, Interior Point and Related Methods (Springer, New York, 1988) 1-28.
5. C.C. Gonzaga and M.J. Todd, An O( √nL)-iteration large-step primal-dual affine algorithm for linear programming, SIAM Journal on Optimization 2 (1992) 349-359.
6. J. Kaliski and Y. Ye, Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program, Operations Research Letters 10 (1991) 389-393.
7. N. Karmarkar (1984), A new polynomial-time algorithm for linear programming, Combinatorica 4 (1991) 373-395.
8. M. Kojima, S. Mizuno and A. Yoshise, An O( √nL) iteration potential reduction algorithm for linear complementarity problems, Mathematical Programming 50 (1991) 331-342.
9. C. McDiarmid, On the improvement per iteration in Karmarkar's algorithm for linear programming, Mathematical Programming, 46 (1990) 299-320.
10. Y. Nesterov, Long-step strategies in interior-point potential reduction methods, Department SES COMIN, Geneva University, 1993.
11. M.J.D. Powell, On the number of iterations of Karmarkar's algorithm for linear programming, Mathematical Programming 62 (1993) 153-197.
12. J. Renegar, A polynomial-time algorithm, based on Newton's method, for linear programming, Mathematical Programming 40 (1988) 59-93.
13. K. Tanabe, Centered Newton method for mathematical programming, in: M. Iri and K. Yajima, eds., System Modeling and Optimization: Proceedings of the 13th IFIP Conference, Tokyo, Japan, Aug.-Sept. 1987, Lecture Notes in Control and Information Sciences 113 (Springer, Berlin, 1988) 197-206.
14. M.J. Todd, A lower bound on the number of iterations of primal-dual interior-point methods for linear programming, in: G.A. Watson and D.F. Griffiths, eds., Numerical Analysis 1993, Pitman Research Notes in Mathematics 303 (Longman Press, Burnt Hill, UK, 1994) 237-259.
15. M.J. Todd and Y. Ye, A centered projective algorithm for linear programming, Mathematics of Operations Research 15 (1990) 508-529.
16. M.J. Todd and Y. Ye, A lower bound on the number of iterations of long-step and polynomial interior-point programming algorithms, to appear in Annals of Operations Research (1995).
17. Y. Ye, A class of projective transformations for linear programming, SIAM Journal on Computing 19 (1990) 457-466.
18. 3L) potential reduction algorithm for linear programming, Mathematical Programming 50 (1991) 239-258.
19. Y. Ye, K. Kortanek, J. Kaliski and S. Huang, Near boundary behavior of the primal-dual potential reduction algorithm for linear programming, Mathematical Programming 58 (1993) 243-255.