High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems

References

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