The largest step path following algorithm for monotone linear complementarity problems

Mathematical Programming, Series B

Volumn 76, Issue 2, 1997, Pages 309-332

  Gonzaga, Clovis C ^a  

^a FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

Author keywords

Convergence of algorithms; Linear complementarity problem; Primal dual interior point algorithm

Indexed keywords

EID: 0039924840     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614443     Document Type: Article

References (26)

1. 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).
2. J.F. Bonnans and C.C. Gonzaga, Convergence of interior point algorithms for the monotone linear complementarity problem, Mathematics of Operations Research, to appear.
3. C.C. Gonzaga, Large steps path-following methods for linear programming, Part I: Barrier function method, SIAM Journal on Optimization 1 (1991) 268-279.
4. C.C. Gonzaga, Path following methods for linear programming, SIAM Review 34 (1992) 167-227.
5. 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 Journal on Optimization, to appear.
6. C.C. Gonzaga and R.A. Tapia, On the quadratic convergence of the simplified Mizuno-Todd-Ye algorithm for linear programming, SIAM Journal on Optimization, to appear.
7. O. Güler, Generalized linear complementarity problems and interior point algorithms for their solutions, Internal Report, Department of Industrial Engineering and Operations Research, University of California (1993).
8. M. Kojima, N. Megiddo, T. Noma and A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science, 538 (Springer Verlag, Berlin, 1991).
9. M. Kojima, S. Mizuno and A. Yoshise, A polynomial-time algorithm for a class of linear complementarity problems, Mathematical Programming 44 (1989) 1-26.
10. M. Kojima, S. Mizuno and A. Yoshise, A primal-dual interior point algorithm for linear programming, in: N. Megiddo, ed., Progress in Mathematical Programming: Interior Point and Related Methods (Springer Verlag, New York, 1989) 29-47.
11. Z.Q. Luo and Y. Ye, A genuine quadratically convergent polynomial interior point algorithm for linear programming, Technical Report, Department of Management Science, University of Iowa, Iowa City, IA (1993).
12. K. McShane, Superlinearly convergent O(√nL)-iteration interior-point algorithms for LP and the monotone LCP, SIAM Journal on Optimization 4 (1994) 247-261.
13. N. Megiddo, Pathways to the optimal set in linear programming, in: N. Megiddo, ed., Progress in Mathematical Programming: Interior Point and Related Methods (Springer Verlag, New York, 1989) 131-158.
14. S. Mehrotra, Quadratic convergence in a primal-dual method, Technical Report 91-15, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL (1991).
15. S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM Journal on Optimization 2 (1992) 575-601.
16. S. Mizuno, A new polynomial time method for a linear complementarity problem, Mathematical Programming 56 (1992) 31-43.
17. S. Mizuno, M.J. Todd and Y. Ye, On adaptive step primal dual interior-point algorithms for linear programming, Mathematics of Operations Research, to appear.
18. S. Mizuno, A. Yoshise and T. Kikuchi, Practical polynomial time algorithms for linear complementarity problems, Journal of the Operations Research Society of Japan 32 (1989) 75-92.
19. R.D.C. Monteiro and I. Adler, Interior path following primal-dual algorithms: Part I: Linear programming, Mathematical Programming 44 (1989) 27-41.
20. R.D.C. Monteiro and I. Adler, Interior path following primal dual algorithms: Part II: Convex quadratic programming, Mathematical Programming 44 (1989) 43-66.
21. R.D.C. Monteiro and T. Tsuchiya, Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem, Working Paper 92-28, Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ (1992).
22. R.D.C. Monteiro and S. Wright, Local convergence of interior-point algorithms for degenerate monotone LCP, Preprint MSC-P357-0493, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (1993).
23. C. Roos and J.P. Vial, A polynomial method of approximate centers for linear programming, Mathematical Programming 54 (1992) 295-305.
24. Y. Ye, Improving the asymptotic convergence of interior-point algorithms for linear programming, Working Paper 91-15, Department of Management Science, University of Iowa, Iowa City, IA (1991).
25. Y. Ye and K.M. Anstreicher, On quadratic and O(√nL) convergence of a predictor-corrector algorithm for the linear complementary problem, Mathematical Programming 62 (1993) 537-551.
26. Y. Ye, O. Güler, R.A. Tapia and Y. Zhang, A quadratically convergent O(√nL)-iteration algorithm for linear programming, Mathematical Programming 59 (1993) 151-162.