On Mehrotra-type predictor-corrector algorithms

SIAM Journal on Optimization

Volumn 18, Issue 4, 2007, Pages 1377-1397

  Salahi, M ^a   Peng, J ^b   Terlaky, T ^c  

^a UNIVERSITY OF GUILAN   (Iran)

^b University of Illinois at Urbana Champaign   (United States)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

Interior point methods; Linear optimization; Mehrotra type algorithm; Polynomial complexity; Predictor corrector method; Superlinear convergence

Indexed keywords

INTERIOR POINT METHODS; LINEAR OPTIMIZATION; MEHROTRA-TYPE ALGORITHM; POLYNOMIAL COMPLEXITY; PREDICTOR-CORRECTOR METHOD; SUPERLINEAR CONVERGENCE;

ALGORITHMS; CONTROL THEORY; CONVERGENCE OF NUMERICAL METHODS; LARGE SCALE SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

ADAPTIVE ALGORITHMS;

EID: 56749131240     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/050628787     Document Type: Article

References (30)

1. E. D. ANDERSEN AND K. D. ANDERSEN, The MOSEK interior point optimizer for linear programming: An implementation of the homogeneous algorithm, in High Performance Optimization, H. Frenk, K. Roos, T. Terlaky, and S. Zhang, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000, pp. 197-232.
2. K. M. ANSTREICHER AND R. A. BOSCH, A new infinity-norm path following algorithm for linear programming, SIAM J. Optim., 5 (1995), pp. 236-246.
3. C. CARTIS, Some Disadvantages of a Mehrotra-type Primal-Dual Corrector Interior Point Algorithm for Linear Programming, 2005, http://www.optimization-online.org.
4. M. COLOMBO AND J. GONDZIO, Further Development of Multiple Centrality Correctors for Interior Point Methods, 2005, http://www.optimization-online.org.
5. J. CZYZYK, S. MEHRTOTRA, M. WAGNER, AND S. J. WRIGHT, PCx: An interior-point code for linear programming, Optim. Methods Softw., 11/12 (1999), pp. 397-430.
6. J. GONDZIO, Multiple centrality corrections in a primal-dual method for linear programming, Comput. Optim. Appl., 6 (1996), pp. 137-156.
7. C. C. GONZAGA, Complexity of predictor-corrector algorithms for LCP based on a large neighborhood of the central path, SIAM J. Optim., 10 (1999), pp. 183-194.
8. P.-F. HUNG AND Y. YE, An asymptotical O(√nL)-iteration path-following linear programming algorithm that uses wide neighborhoods, SIAM J. Optim., 6 (1996), pp. 570-586.
9. F. JARRE AND M. WECHS, Extending Mehrotra's corrector for linear programs, Adv. Model. Optim., 1 (1999), pp. 38-60.
10. J. JI, F. A. POTRA, AND S. HUANG, A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence, J. Optim. Theory Appl., 84 (1995), pp. 187-199.
11. N. K. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
12. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 131-158.
13. S. MEHROTRA, On finding a vertex solution using interior-point methods, Linear Algebra Appl., 152 (1991), pp. 233-253.
14. S. MEHROTRA, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
15. S. MEHROTRA AND Z. LI, Convergence conditions and Krylov subspace-based corrections for primal-dual interior-point method, SIAM J. Optim., 15 (2005), pp. 635-653.
16. 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.
17. R. D. C. MONTEIRO, I. ADLER, AND M. G. C. RESENDE, A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extensions, Math. Oper. Res., 15 (1990), pp. 191-214.
18. J. PENG, T. TERLAKY, AND Y. ZHAO, A predictor-corrector algorithm for linear optimization based on a specific self-regular proximity function, SIAM J. Optim., 15 (2005), pp. 1105-1127.
19. F. A. POTRA, The Mizuno-Todd-Ye algorithm in a large neighborhood of the central path, European J. Oper. Res., 143 (2002), pp. 257-267.
20. F. A. POTRA, A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path, Math. Program., 100 (2004), pp. 317-337.
21. F. A. POTRA AND X. LIU, Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path, Optim. Methods Softw., 20 (2005), pp. 145-168.
22. C. ROOS, T. TERLAKY, AND J.-PH.VIAL, Theor-y and Algorithms for Linear Optimization: An Interior Point Approach, John Wiley and Sons, Chichester, UK, 1997.
23. M. SALAHI AND T. TERLAKY, Adaptive large neighborhood self-regular predictor-corrector IPMs for LO, J. Optim. Theory Appl., 132 (2007), pp. 143-160.
24. G. SONNEVEND, An "analytic center" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in System Modeling and Optimization: Proceedings of the 12th IFIP Conference (Budapest 1985), Lecture Notes in Control Inform. Sci. 84, A. Prékopa, J. Szelezsán, and B. Strazicky, eds., Springer-Verlag, Berlin, 1986, pp. 866-876.
25. R. TAPIA, Y. ZHANG, M. SALTZMAN, AND A. WEISER, The Mehrotra predictor-corrector interior-point method as a perturbed composite Newton method, SIAM J. Optim., 6 (1996), pp. 47-56.
26. S. J. WRIGHT, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, 1997.
27. Y. YE, Interior Point Algorithms, Theory and Analysis, John Wiley and Sons, Chichester, UK, 1997.
28. Y. ZHANG AND D. ZHANG, On the polynomiality of the Mehrotra-type predictor-corrector interior point algorithms, Math. Programming, 68 (1995), pp. 303-317.
29. Y. ZHANG, Solving large-scale linear programs by interior point methods under the MATLAB environnent, Optim. Methods Softw., 10 (1999), pp. 1-31.
30. X. ZHU, J. PENG, T. TERLAKY, AND G. ZHANG, On Implementing Self-Regular Proximity Based Feasible IPMs, Technical report 2003/2, Advanced Optimization Lab, Department of Computing and Software, McMaster University, Hamilton, ON, Canada, http://www.cas.mcmaster.ca/~oplab/publication.