How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds

Mathematical Programming

Volumn 113, Issue 1, 2008, Pages 1-14

  Deza, Antoine ^a   Nematollahi, Eissa ^a   Terlaky, Tamás ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Interior point method; Linear programming; Worst case iteration complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING;

INTERIOR POINT METHOD; WORST-CASE ITERATION-COMPLEXITY;

LINEAR PROGRAMMING;

EID: 38349176265     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0044-x     Document Type: Article

References (16)

1. Dantzig G.B. (1951) Maximization of a linear function of variables subject to linear inequalities. In: Koopmans T.C. (ed) Activity Analysis of Production and Allocation. Wiley, New York, pp. 339-347
2. Deza A., Nematollahi E., Peyghami R., Terlaky T. (2006) The central path visits all the vertices of the Klee-Minty cube. Optim. Methods Softw. 21-5, 851-865
3. Deza, A., Terlaky, T., Zinchenko, Y.: Polytopes and arrangements: diameter and curvature. AdvOL-Report 2006/09, McMaster University (2006)
4. Karmarkar N.K. (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4, 373-395
5. Khachiyan L.G. (1979) A polynomial algorithm in linear programming. Soviet Math. Doklady 20, 191-194
6. Klee V., Minty G.J. (1972) How good is the simplex algorithm?. In: Shisha O. (ed) Inequalities III. Academic, New York, pp. 159-175
7. Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior-Point and Related Methods. Springer, Berlin Heidelberg New York pp. 131-158 (1988);
8. also in: Proceedings of the 7th Mathematical Programming Symposium of Japan, pp. 1-35. Nagoya, Japan (1986)
9. Megiddo N., Shub M. Boundary behavior of interior point algorithms in linear programming. Math. Oper. Res. 14-1, 97-146 (1989)
10. Roos, C., Terlaky, T., Vial, J.-Ph.: Theory and algorithms for linear optimization: an interior point approach. In: Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1997)
11. Sonnevend, G.: An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prékopa, A., Szelezsán, J., Strazicky, B. (eds.) System Modelling and Optimization: Proceedings of the 12th IFIP-Conference, Budapest 1985. Lecture Notes in Control and Information Sciences, Springer, Berlin Heidelberg New York Vol. 84, pp. 866-876 (1986)
12. Terlaky T., Zhang S. (1993) Pivot rules for linear programming - a survey. Ann. Oper. Res. 46, 203-233
13. Todd M., Ye Y. (1996) A lower bound on the number of iterations of long-step and polynomial interior-point linear programming algorithms. Ann. Oper. Res. 62, 233-252
14. Vavasis S., Ye Y. (1996) A primal-dual interior-point method whose running time depends only on the constraint matrix. Math. Programm. 74, 79-120
15. Wright S.J. (1997) Primal-Dual Interior-Point Methods. SIAM Publications, Philadelphia
16. Ye Y. (1997) Interior-Point Algorithms: Theory and Analysis. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York