Improved complexity results on solving real-number linear feasibility problems

Mathematical Programming

Volumn 106, Issue 2, 2006, Pages 339-363

  Ye, Yinyu ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; NUMBER THEORY; PROBLEM SOLVING; VECTORS;

CONSTRAINT MATRIX; OBJECTIVE COEFFICIENT VECTOR; REAL-NUMBER LINEAR FEASIBILITY PROBLEMS; RIGHT-HAND-SIDE VECTOR;

LINEAR PROGRAMMING;

EID: 31744432650     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0610-7     Document Type: Article

References (28)

1. Bayer, D.A., Lagarias, J.C.: The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories. Transactions of the AMS 314, 527-581 (1989)
2. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation (Springer-Verlag, 1996)
3. Forsgren, A.: On linear least-squares problems with diagonally dominant weight matrices. SIAM J. Matrix Anal. Appl. 17, 763-788 (1996)
4. Fruend, R.M., Vera, J.R.: Some characterization and properties of the "distance to ill-posedness" and the condition measures of a conic linear system. Math. Program. 86, 225-260 (1999)
5. Gonzaga, C.C.: Path-following methods for linear programming. SIAM Review 34, 167-224 (1992)
6. Gonzaga, C.C., Lara, H.J.: A note on properties of condition numbers. Department of Mathematics, Federal University of Santa Catarina, Cx. Postal 5210, 88040-970 Florianopolis, SC, Brazil, 1996
7. Ho, J.C.K., Tuncel, L.: Reconciliation of various complexity and condition measures for linear programming problems and a generalization of Tardos' theorem. Foundations of computational mathematics, Proceedings of the Smalefest, World Scientific, 2002, pp. 93-147
8. Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373-395 (1984)
9. Khachiyan, L.G.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244, 1093-1086 (1979);
10. Translated in Soviet Math. Dokl. 20, pp. 191-194
11. Kojima, M., Mizuno, S., Yoshise, A.: A polynomial-time algorithm for a class of linear complementarity problems. Math. Program. 44, 1-26 (1989)
12. Megiddo, N.: Pathways to the optimal set in linear programming. In: Progress in Mathematical Programming: Interior Point and Related Method, N. Megiddo (ed.), (Springer, New York, 1989) pp. 131-158
13. Megiddo, N., Mizuno, S., Tsuchiya, T.: A modified layered-step interior-point algorithm for linear programming. Math. Program. 82, 339-356 (1998)
14. Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964-981 (1993)
15. Monteiro, R.C., Adler, I.: Interior path following primal-dual algorithm. Part I: linear programming. Math. Program. 44, 27-41 (1989)
16. Monteiro, R.C., Tsuchiya, T.: A variant of the Vavasis-Ye layered-step interior-point algorithm for linear programming. SIAM J. Optimization 13, 1054-1079 (2003)
17. Monteiro, R.C., Tsuchiya, T.: A new iteration-complexity bound for the MTY predictor-corrector algorithm, Research Memorandum No. 856, The Inistitute of Statistical Mathematics, Tokyo, Japan, October 2002
18. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity (Prentice Hall, Englewood Cliffs, New Jersey, 1982)
19. Renegar, J.: A polynomial-time algorithm based on Newton's method for linear programming. Math. Program. 40, 59-94 (1988)
20. Renegar, J.: Linear programming, complexity theory, and elementary functional analysis. Math. Program. 70, 279-351 (1995)
21. Sonnevend, G., Stoer, J., Zhao, G.: On the complexity of following the central path of linear programs by linear extrapolation II. Math. Program. 52, 527-553 (1991)
22. Stewart, G.W.: On scaled projections and pseudoinverses. Linear Algebra and its Applications 112, 189-193 (1989)
23. Todd, M.J.: A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm. Oper. Res. 38, 1006-1018 (1990)
24. Todd, M.J., Tuncel, L., Ye, Y.: Probabilistic analysis of two complexity measures for linear programming problems. Math. Program. 90, 59-69 (2001)
25. Vavasis, S.A., Ye, Y.: A simplification to "A primal-dual interior-point method whose running time depends only on the constraint matrix," H. Frenk et al., High Performance Optimization (Kluwer Academic Publishers, 2000), pp. 233-265
26. Vavasis, S., Ye, Y.: A primal-dual interior-point method whose running time depends only on the constraint matrix. Math. Program. 74, 79-120 (1996)
27. Vavasis, S., Ye, Y.: Identifying an optimal basis in linear programming. Annals Oper. Res. 62, 565-572 (1996)
28. Ye, Y.: On the finite convergence of interior-point algorithms for linear programming. Math. Program. 57, 325-335 (1992)