A superquadratic infeasible-interior-point method for linear complementarity problems

We consider a modification of a path-following infeasible-interior-point algorithm described by Wright. In the new algorithm, we attempt to improve each major iterate by reusing the coefficient matrix factors from the latest step. We show that the modified algorithm has similar theoretical global convergence properties to those of the earlier algorithm while its asymptotic convergence rate can be made superquadratic by an appropriate parameter choice.

[1]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[2]  Jeffrey C. Lagarias,et al.  Power series variants of Karmarkar-type algorithms , 1989, AT&T Technical Journal.

[3]  F. Potra.  OnQ-order andR-order of convergence , 1989 .

[4]  Olvi L. Mangasarian,et al.  Error bounds for nondegenerate monotone linear complementarity problems , 1990, Math. Program..

[5]  Shinji Mizuno,et al.  An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..

[6]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[7]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[8]  Stephen J. Wright.  A path-following infeasible-interior-point algorithm for linear complementarity problems , 1993 .

[9]  Shinji Mizuno,et al.  On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..

[10]  Yinyu Ye,et al.  On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP , 1993, Math. Program..

[11]  Yin Zhang,et al.  On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem , 1994, SIAM J. Optim..

[12]  Stephen J. Wright.  An infeasible-interior-point algorithm for linear complementarity problems , 1994, Math. Program..

[13]  Kevin A. McShane.  Superlinearly Convergent O(√(n) L)-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem , 1994, SIAM J. Optim..

[14]  F. Potra,et al.  Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence , 1995 .

[15]  Sanjay Mehrotra,et al.  Asymptotic convergence in a generalized predictor-corrector method , 1996, Math. Program..

[16]  Florian A. Potra,et al.  Predictor-corrector algorithm for solvingP*(κ)-matrix LCP from arbitrary positive starting points , 1996, Math. Program..

[17]  Yin Zhang,et al.  A Mehrotra-type predictor-corrector algorithm with polynomiality andQ-subquadratic convergence , 1996, Ann. Oper. Res..

[18]  Florian A. Potra,et al.  AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence , 1996, Ann. Oper. Res..

[19]  Stephen J. Wright,et al.  A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP , 1996, SIAM J. Optim..