High order infeasible-interior-point methods for solving sufficient linear complementarity problems

Mathematics of Operations Research

Volumn 23, Issue 4, 1998, Pages 832-862

  Stoer, Josef ^a   Wechs, Martin ^a   Mizuno, Shinji ^b  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

High order methods; Interior point methods; Linear complementarity problems

Indexed keywords

APPROXIMATION THEORY; MATRIX ALGEBRA; PROBLEM SOLVING;

HIGHER ORDER INFEASIBLE-INTERIOR-METHODS; HORIZONTAL LINEAR COMPLEMENTARITY;

LINEAR PROGRAMMING;

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

References (20)

1. Bonnans, J. F., C. C. Gonzaga. 1996. Convergence of interior point algorithms for the monotone linear complementarity problem. Math. Oper. Res. 21 1-25.
2. Cottle, R. W., J.-S. Pang, V. Venkateswaran. 1989, Sufficient matrices and the linear complementarity problem. Linear Algebra Appl. 114/115 231-249.
3. Ji, J., F. A. Potra, R. Sheng. 1994. A predictor-corrector method for solving the P*-matrix LCP from infeasible starting points. Technical Report No. 55/1994, Department of Mathematics, The University of Iowa, Iowa City.
4. Kojima, M., N. Megiddo, T. Noma, A. Yoshishe. 1991. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Springer-Verlag, Berlin.
5. _, S. Mizuno, T. Noma. 1990. Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems. Math. Oper. Res. 15 662-675.
6. Mehrotra, S. 1992. On the implementation of a primal-dual interior point method. SIAM J. Optim. 2 575-601.
7. Mizuno, S. 1996. A superlinearly convergent infeasible-interior-point algorithm for geometrical LCP's without a strictly complementarity condition. Math. Oper. Res. 21 382-400.
8. _, F. Jarre, J. Stoer. 1996. A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems. Appl. Math. Optim. 13 315-341.
9. _, M. J. Todd, Y. Ye. 1993. On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18 964-981.
10. Monteiro, R. D. C., I. Adler, M. G. C. Resende. 1990. A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. 15 191-214.
11. _, T. Tsuchyia. 1996. Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem. Math. Oper. Res. 21 793-814.
12. Potra, F. A., R. Sheng. 1995. A superlinearly convergent infeasible-interior-point algorithm for degenerate LCP. Technical Report No. 66/1994, Department of Mathematics, The University of Iowa, Iowa City.
13. Stoer, J., M. Wechs. 1996a. On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems. To appear in Numer. Math.
14. _, _. 1996b. Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. To appear in Math. Programming.
15. Sturm, J. F. 1996. Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementarity solution exists. Report 9656/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands.
16. Tanabe, K. 1988. Centered Newton method for mathematical programming. Iri, M., Yajima K., eds. System Modeling and Optimization. Springer-Verlag, New York, 197-206.
17. Valiaho, H. 1996. P*-matrices are just sufficient. Linear Algebra Appl. 239 103-108.
18. Wright, S., Y. Zhang. 1996. A superquadratic infeasible-interior-point method for linear complementarity problems. Math. Programming 73 269-289.
19. Ye, Y., K. Anstreicher. 1993. On quadratic and O(√nL) convergence of a predictor-corrector algorithm for LCP. Math. Programming 62 537-551.
20. Zhang, Y., D. Zhang. 1995. On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. Math. Programming 68 303-318.