A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms

Mathematical Programming

Volumn 115, Issue 1, 2008, Pages 105-149

  Monteiro, Renato D C ^a   Tsuchiya, Takashi ^b  

^a Georgia Institute of Technology   (United States)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

Affine scaling; Central path; Condition number; Crossover events; Interior point algorithms; Layered least squares steps; Path following; Polynomial complexity; Predictor corrector; Primal dual algorithms; Scale invariance; Strongly polynomial

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGRAL EQUATIONS; ITERATIVE METHODS; LINEAR PROGRAMMING; MATRIX ALGEBRA;

AFFINE SCALING; CENTRAL PATH; CONDITION NUMBERS; CROSSOVER EVENTS; INTERIOR POINT ALGORITHMS; LAYERED LEAST SQUARES STEPS; PATH FOLLOWING; POLYNOMIAL COMPLEXITY; PREDICTOR CORRECTORS; PRIMAL DUAL ALGORITHMS;

ALGORITHMS;

EID: 43949117432     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0141-5     Document Type: Article

References (22)

1. Dikin I.I. (1974). On the speed of an iterative process. Upravlyaemye Sistemi 12: 54-60
2. Forsgren A. (1996). On linear least-squares problems with diagonally dominant weight matrices. SIAM J. Matrix Anal. Appl. 17: 763-788
3. Gonzaga C.C. (1992). Path-following methods for linear programming. SIAM Rev. 34: 167-224
4. Gonzaga C.C., Lara H.J. (1997). A note on properties of condition numbers. Linear Algebra Appl. 261: 269-273
5. Karmarkar, N.: Riemannian geometry underlying interior-point methods for linear programming. Mathematical Developments Arising from Linear Programming, In: Brunswick, M.E., (ed), pp. 51-75. Contemporary Mathematics, Vol. 114, American Mathematical Society, Providence, 1990
6. Megiddo N., Mizuno S., Tsuchiya T. (1998). A modified layered-step interior-point algorithm for linear programming. Math. Program. 82: 339-355
7. Mizuno S., Todd M.J., Ye Y. (1993). On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18: 964-981
8. Monteiro R.D.C., Tsuchiya T. (1998). Global convergence of the affine scaling algorithm for convex quadratic programming. SIAM J. Optim. 8(1): 26-58
9. Monteiro R.D.C., Tsuchiya T. (2003). A variant of the Vavasis-Ye layered-step interior-point algorithm for linear programming. SIAM J. Optim. 13: 1054-1079
10. Monteiro R.D.C., Tsuchiya T. (2004). A new iteration-complexity bound for the MTY predictor-corrector algorithm. SIAM J. Optim. 15: 319-347
11. Sonnevend G., Stoer J., Zhao G. (1991). On the complexity of following the central path of linear programs by linear extrapolation. II. Math. Program. 52: 527-553
12. Stewart G.W. (1989). On scaled projections and pseudoinverses. Linear Algebra Appl. 112: 189-193
13. Todd M.J. (1990). A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm. Oper. Res. 38: 1006-1018
14. Todd M.J., Tunçel L., Ye Y. (2001). Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems. Math. Program. 90(1): 59-70
15. Tsuchiya T. (1992). Global convergence property of the affine scaling method for primal degenerate linear programming problems. Math. Oper. Res. 17: 527-557
16. Tunçel L. (1999). Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. Math. Program. 86(1): 219-223
17. Tunçel L. (1999). On the condition numbers for polyhedra in Karmarkar's form. Oper. Res. Lett. 24(4): 149-155
18. Vanderbei R.J., Lagarias J.C. (1990). I. I. Dikin's convergence result for the affine-scaling algorithm, Vol 17. Contemp. Math. 114: 109-119
19. Vavasis S., Ye Y. (1996). A primal-dual accelerated interior point method whose running time depends only on A. Math. Program. 74: 79-120
20. Vavasis, S., Ye, Y.: On the relationship between layered least squares and affine scaling steps. In: The Mathematics of Numerical Analysis, pp. 857-865. Lectures in Applied Mathematics, Vol. 32. American Mathematical Society, Providence, 1996
21. Zhao G. (1996). On the relationship between the curvature integral and the complexity of path-following methods in linear programming. SIAM J. Optim. 6: 57-73
22. Zhao G., Stoer J. (1993). Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals. Appl. Math. Optim. 27: 85-103