A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition

Mathematics of Operations Research

Volumn 21, Issue 2, 1996, Pages 382-400

  Mizuno, Shinji ^a  

^a INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

Interior point algorithm; Linear complementarity problem; Strict complementarity; Superlinear convergence

Indexed keywords

COMPUTATIONAL GEOMETRY; CONVERGENCE OF NUMERICAL METHODS; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

INTERIOR POINT ALGORITHMS; LINEAR COMPLEMENTARITY PROBLEM; SUPERLINEAR CONVERGENCE;

ALGORITHMS;

EID: 0030134078     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.21.2.382     Document Type: Article

References (19)

1. Iri, M., H. Imai (1986). A multiplicative barrier function method for linear programming. Algorithmica 1 455-482.
2. Kojima, M., N. Megiddo, S. Mizuno (1993). A primal-dual infeasible-interior-point algorithm for linear programming. Math. Programming 61 261-280.
3. _, S. Mizuno, A. Yoshise (1989). A polynomial-time algorithm for a class of linear complementarity problems. Math. Programming 44 1-26.
4. Megiddo, N. (1989). Pathways to the optimal set in linear programming. N. Megiddo, ed., Progress in Mathematical Programming, Interior-Point and Related Methods, Springer-Verlag, New York, 131-158.
5. Mehrotra, S. (1993). Quadratic convergence in a primal-dual method. Math. Oper. Res. 18 741-751.
6. Mizuno, S., F. Jarre, J. Stoer (1994). A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems. Preprint 213, Mathematische Institute, Universität Würzburg, Germany.
7. _, M. Kojima, M. J. Todd (1995). Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming. SIAM J. Optim. 5 52-67.
8. _, M. J. Todd, Y. Ye (1993). On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18 964-981.
9. Monteiro, R. D. C., T. Tsuchiya (1992). Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem. Working Paper, University of Arizona.
10. _, S. J. Wright (1994). Local convergence of interior-point algorithms for degenerate monotone LCP. Comput. Optim. Appl. 3 131-155.
11. Potra, F. A. (1993). An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence. Department of Mathematics, The University of Iowa, Iowa City, Iowa.
12. _ (1994). A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Programming 67 383-406.
13. Stoer, J. (1994). The complexity of an infeasible interior-point path-following method for the solution of linear programs. Optimization Methods and Software 3 1-12.
14. Tsuchiya, T. (1991). Quadratic convergence of Iri and Imai's algorithm for degenerate linear programming problems. Research Memorandum 412, The Institute of Statistical Mathematics, Tokyo.
15. Wright, S. (1994). An infeasible interior point algorithm for linear complementarity problems. Math. Programming 67 29-52.
16. Ye, Y., K. Anstreicher (1993). On quadratic and O(√nL) convergence of a predictor-corrector algorithm for LCP. Math. Programming 62 537-551.
17. Ye, Y., O. Güler, R. A. Tapia, Y. Zhang (1993). A quadratically convergent O(√nL)-iteration algorithm for linear programming. Math. Programming 59 151-162.
18. Zhang, Y. (1994). On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4 208-227.
19. _, D. Zhang (1994). Superlinear convergence of infeasible-interior-point methods for linear programming. Math. Programming 66 361-378.