On the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set

SIAM Journal on Optimization

Volumn 7, Issue 1, 1997, Pages 47-65

  Gonzaga, Clovis C ^a   Tapia, Richard A ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b Rice University   (United States)

Author keywords

Analytic center; Linear programming; Predictor corrector algorithm; Primal dual interior point algorithm

Indexed keywords

EID: 0031542596     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623493243557     Document Type: Article

References (27)

1. I. ADLER AND R. D. C. MONTERIO, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Math. Programming. 50 (1991), pp. 29-51.
2. A. CHARNES, W. W. COOPER, AND R. M. THRALL, A structure for classifying and characterizing efficiency and ineffeciency in data envelopment analysis, J. Productivity Anal., 2 (1991), pp. 197-237.
3. C. GONZAGA, Path-following methods for linear programming, SIAM Rev., 34 (1992), pp. 167-224.
4. W. W. HOGAN, Point-to-set maps in mathematical programming, SIAM Rev., 15 (1973), pp. 591-603
5. P. HUARD, Point-to-set maps in mathematical programming, Math. Programming Study 10, North-Holland Publishing, Amsterdam, 1979.
6. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior-point method for linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods, Nimrod Megiddo, ed., Springer-Verlag, Berlin, New York, 1989, pp. 29-47.
7. M. KOJIMA, S. MIZUNO, AND A. YOSHIE, An O(√nL) iteration potential reduction algorithm for linear complementarity problems, Math. Programming, 90 (1991), pp. 331-342.
8. I. J. LUSTIG, R. E. MARSTEN, AND D. F. SHANNO, Computational experience with a primal-dual interior-point method for linear programming, Linear Algebra Appl., 152 (1991), pp. 191-222.
9. L. MCLINDEN, An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem, Pacific J. Math., 88 (1980), pp. 101-161.
10. K. MCSHANE, Superlinearly convergent O(√nL)-iteration interior-point algorithm for linear programming and the monotone linear complementarity problem, SIAM J. Optim., 4 (1994), pp. 247-261.
11. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods, Nimrod Megiddo, ed., Springer-Verlag, Berlin, New York, 1989, pp. 131-158.
12. N. MEGIDDO AND M. SHUB, Boundary behavior of interior point algorithms in linear programming, Math. Oper. Res., 14 (1989), pp. 97-146.
13. S. MEHROTRA, Quadratic convergence in a primal-dual method, Math. Oper. Res., 18 (1993), pp. 741-751.
14. S. MIZUNO, M. J. TODD, AND Y. YE, On adaptive-step primal-dual interior-point algorithms for linear programming, Math. Oper. Res., 18 (1993), pp. 964-981.
15. R. C. MONTERIO AND I. ADLER, Interior path-following primal-dual algorithm. Part I: Linear programming, Math. Programming, 44 (1989), pp. 27-41.
16. G. SONNEVEND, An analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in Lecture Notes in Control and Information Sciences 84, Springer-Verlag, Berlin, New York, 1985, pp. 866-876.
17. R. A. TAPIA, Y. ZHANG, AND Y. YE, On the convergence of the iteration sequence in primal-dual interior point methods, Math. Programming, 68 (1995), pp. 141-154.
18. M. J. TODD AND Y. YE, A centered projective algorithm for linear programming, Math. Oper. Res., 15 (1990), pp. 508-529.
19. Y. YE, On the Q-order of convergence of interior-point algorithms for linear programming, in Proc. 1992 Symposium on Applied Mathematics, Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China, 1992, pp. 534-543.
20. Y. YE, O. GÜLER, R. A. TAPIA, AND Y. ZHANG, A quadratically convergent O(√nL)-iteration algorithm for linear programmig, Math. Programming, 59 (1993), pp. 151-162.
21. Y. YE, R. A. TAPIA, AND Y. ZHANG, A Superlinearly Convergent O(√nL)-Iteration Algorithm for Linear Programming, Technical report TR91-22, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1991.
22. Y. ZHANG AND A. EL-BAKRY, A Modified Predictor-Corrector Algorithm for Locating Weighted Centers, in Linear Programming, Technical report TR92-19, Dept. of Computational and Applied Mathematics, Rice university, Houston, TX, 1992.
23. Y. ZHANG AND R. A. TAPIA, A superlinearly convergent polynomial primal-dual interior-point algorithm for linear programming, SIAM J. Optim., 3 (1993), pp. 118-133.
24. Y. ZHANG AND R . A. TAPIA, Superlinear and quadratic covergence of primal-dual interior-point methods for linear programming revisited, J. Optim. Theory Appl., 73 (1992), pp. 229-242.
25. Y. ZHANG AND R. A. TAPIA, On the Convergence of Interior-Point Methods to the Center of the Solution Set in Linear Programming, Technical report TR91-30, Dept. of Computational and Applied Mathematics, Rice University, Houston, TX, 1991.
26. Y. ZHANG, R. A. TAPIA, AND J. E. DENNIS, On the superlinear and quadratic convergence of primal-dual interior-point linear programming algorithms, SIAM J. Optim., 2 (1992), pp. 304-324.
27. Y. ZHANG, H. TAPIA, AND F. POTRA, On the superlinear convergence of interior-point algorithms, for a general class of problems, SIAM J. Optim., 3 (1993), pp. 413-422.