Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

Mathematical Programming, Series B

Volumn 83, Issue 3, 1998, Pages 407-423

  Stoer, Josef ^a   Wechs, Martin ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Horizontal linear complementarity problems; Infeasible interior point paths; Sufficient matrices

Indexed keywords

EID: 0347031130     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02680568     Document Type: Article

References (16)

1. R.W. Cottle, J.-S. Pang, R.E. Stone, The Linear Complementarity Problem, Academic Press, Boston, MA, 1992.
2. R.W. Cottle, J.-S. Pang, V. Venkateswaran, Sufficient matrices and the linear complementarity problem, Linear Algebra Appl. 114/115 (1989) 231-249.
3. M.S. Gowda, On the extended linear complementarity problem, Technical Report, Dept. of Math. & Physics, University of Maryland, Baltimore, MD, 1995.
4. 0, Linear Algebra Appl. 223/224 (1995) 325-335.
5. M. Kojima, N. Megiddo, S. Mizuno, A primal-dual exterior point algorithm for linear programming, Research Report RJ 8500, IBM Almaden Research Center, San Jose, CA, 1991.
6. M. Kojima, N. Megiddo, T. Noma, A. Yoshishe, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer, Berlin, 1991.
7. M. Kojima, S. Mizuno, T. Noma, Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems, Mathematics of Operations Research 15 (1990) 662-675.
8. S. Mizuno, F. Jarre, J. Stoer, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, J. Appl. Math. Opt. 33 (1996) 315-341.
9. R.D.C. Monteiro, T. Tsuchyia, Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem, Technical Report, Dept. of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 1992.
10. F.A. Potra, An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence, Tech. Report, Department of Mathematics, The University of Iowa, Iowa City, IA, 1994.
11. F.A. Potra, R. Sheng, A large-step infeasible-interior-point method for the P*-matrix LCP, Technical Report No. 64/1994, Department of Mathematics, University of Iowa, Iowa City, IA, 1994.
12. F.A. Potra, R. Sheng, A superlinearly infeasible-interior-point algorithm for degenerate LCP, Technical Report No, 66/1994, Department of Mathematics, University of Iowa, Iowa City, IA, 1995.
13. S.M. Robinson, Some continuity properties of polyhedral multifunctions, Mathematical Programming Study 14 (1981) 206-214.
14. G. Sonnevend, An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in: Lecture Notes in Control and Information Sciences, vol. 84, Springer, Berlin, 1985, pp. 866-876.
15. J. Stoer, M. Wechs, On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems (to appear in Numer. Mathematik).
16. H. Väliaho, P*-matrices are just sufficient, Linear Algebra Appl. 239 (1996) 103-108.