On the local superlinear convergence of a Newton-type method for LCP under weak conditions

The paper proposes a damped Newton-type algorithm for linear complementarity problems (LCP). The algorithm is based on a special transformation of the LCP into an equivalent nonlinear system of equations and modifies a method proposed in a preceding paper of the author At first, results on global convergence are proved for LCP with Po-matrices. In particular, it is shown that all occuring subproblems are solvable and each accumulation point generated by the algorithm solves the LCP. Then, motivated by interior-point methods, the paper studies the local convergence to nondegenerated solutions of LCP with positive semi-definite matrices. To prove results, both on the local superlinear and the global convergence, suitably perturbed Newton subproblems will be introduced In contrast with many interior-point methods the algorithm can also have a superlinear rate of convergence if the LCP is degenerate. In particular, it converges Q-superlinearly under some strong second order condition. Furthermore, the Newton-...

[1]  Richard W. Cottle,et al.  A note onQ-matrices , 1979, Math. Program..

[2]  S. M. Robinson.  Some continuity properties of polyhedral multifunctions , 1981 .

[3]  Renato D. C. Monteiro,et al.  Limiting behavior of the affine scaling continuous trajectories for linear programming problems , 1991, Math. Program..

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

[5]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[6]  Yinyu Ye,et al.  On the finite convergence of interior-point algorithms for linear programming , 1992, Math. Program..

[7]  A. Fischer.  A special newton-type optimization method , 1992 .

[8]  Paul Tseng,et al.  Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem , 1992, SIAM J. Optim..

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

[10]  Yin Zhang,et al.  A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..

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

[12]  Olvi L. Mangasarian,et al.  New Error Bounds for the Linear Complementarity Problem , 1994, Math. Oper. Res..

[13]  Florian A. Potra,et al.  A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting points , 1994, Math. Program..

[14]  Christian Kanzow,et al.  Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems , 1996, SIAM J. Optim..

[15]  P. Tseng.  Growth behavior of a class of merit functions for the nonlinear complementarity problem , 1996 .

[16]  Shinji Mizuno.  A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition , 1996, Math. Oper. Res..