Complexity of predictor-corrector algorithms for lcp based on a large neighborhood of the central path

SIAM Journal on Optimization

Volumn 10, Issue 1, 1999, Pages 183-194

  Gonzaga, Clovis C ^a  

^a FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

Author keywords

Linear complementarity problem; Predictor corrector algorithms; Primal dual interior point algorithm

Indexed keywords

EID: 0033274971     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496304141     Document Type: Article

References (19)

1. 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.
2. E. R. BARNES, S. CHOPRA, AND D. J. JENSEN, The Affine Scaling Method with Centering, Technical Report, Department of Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1988.
3. C. C. GONZAGA AND R. A. TAPIA, On the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set, SIAM J. Optim., 7 (1997), pp. 47-65.
4. J. GONDZIO, Multiple centrality corrections in a primal-dual method for linear programming, Comput. Optim. Appl., 6 (1996), pp. 137-156.
5. P. F. HUNG AND Y. YE, An asymptolical O(√nL)-iteration path-following linear programming algorithm that uses wide neighborhoods, SIAM J. Optim., 6 (1996), pp. 570-586.
6. B. JANSEN, C. ROOS, T. TERLAKY, AND J.-PH. VIAL, Primal-dual algorithms for linear programming based on the logarithmic barrier method, J. Optim. Theory Appl., 83 (1994), pp. 1-26.
7. N. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatora, 4 (1984), pp. 373-395.
8. M. KOJIMA, N. MEGIDDO, T. NOMA, AND A. YOSHISE, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Comput. Sci. 538, Springer-Verlag, Berlin, 1991.
9. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming, 44 (1989), pp. 1-26.
10. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point algorithm for linear programming, in Prograss in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 29-47.
11. 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.
12. S. MEHROTRA, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
13. S. MIZUNO, A new polynomial time method for a linear complementarity problem, Math. Programming, 56 (1992), pp. 31-43.
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. D. C. MONTEIRO AND I. ADLER, Interior path following primal-dual algorithms Part I: Linear programming, Math. Programming, 44 (1989), pp. 27-41.
16. R. D. C. MONTEIRO AND I. ADLER, Interior path following primal-dual algorithms: Part II: Convex quadratic programming, Math. Programming, 44 (1989), pp. 43-66.
17. Y. YE AND K. M. ANSTREICHER, On quadratic and O(√nL) convergence of a predictor-corrector algorithm for the linear complementary problem, Math. Programming, 62 (1993), pp. 537-551.
18. Y. YE, O. GÜLER, R. A. TAPIA, AND Y. ZHANG, A quadratically convergent O(√nL)-iteration algorithm for linear programming, Math. Programming, 59 (1993), pp. 151-162.
19. Y. ZHANG AND D. ZHANG, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms, Math. Programming, 68 (1995), pp. 303-317.