Applied Mathematics and Optimization, Vol.40, No.3, 315-339, 1999
A regularization Newton method for solving nonlinear complementarity problems
In this paper we construct a regularization Newton method for solving the nonlinear complementarity problem (NCP(F)) and analyze its convergence properties under the assumption that F is a P-0-function. We prove that every accumulation point of the sequence of iterates is a solution of NCP(F) and that the sequence of iterates is bounded if the solution set of NCP(F) is nonempty and bounded. Moreover, if F is a monotone and Lipschitz continuous function, we prove that the sequence of iterates is bounded if and only if the solution set of NCP(F) is nonempty by setting t = 1/2, where t is an element of [1/2, 1] is a parameter. If NCP(F) has a locally unique solution and satisfies a nonsingularity condition, then the convergence rate is superlinear (quadratic) without strict complementarity conditions. At each step, we only solve a linear system of equations. Numerical results are provided and further applications to other problems are discussed.
Keywords:SEMISMOOTH REFORMULATION;VARIATIONAL-INEQUALITIES;CONVERGENCEANALYSIS;POINT ALGORITHM;EQUATIONS