The convergence of a one-step smoothing Newton method for P0-NCP based on a new smoothing NCP-function

作者:

Highlights:

摘要

The nonlinear complementarity problem (denoted by NCP(F)) can be reformulated as the solution of a nonsmooth system of equations. By introducing a new smoothing NCP-function, the problem is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is proposed for solving the nonlinear complementarity problem with P0-function (P0-NCP) based on the new smoothing NCP-function. The proposed algorithm solves only one linear system of equations and performs only one line search per iteration. Without requiring strict complementarity assumption at the P0-NCP solution, the proposed algorithm is proved to be convergent globally and superlinearly under suitable assumptions. Furthermore, the algorithm has local quadratic convergence under mild conditions.

论文关键词:Nonlinear complementarity problem,Smoothing Newton method,Global convergence,Superlinear/quadratic convergence

论文评审过程:Received 7 September 2006, Revised 25 March 2007, Available online 16 April 2007.

论文官网地址:https://doi.org/10.1016/j.cam.2007.03.031