A variant smoothing Newton method for P0-NCP based on a new smoothing function

In this paper, we present a new one-step smoothing Newton method proposed for solving the non-linear complementarity problem with P0P0-function based on a new smoothing NCPNCP-function. We adopt a variant merit function. Our algorithm needs only to solve one linear system of equations and perform one line search per iteration. It shows that any accumulation point of the iteration sequence generated by our algorithm is a solution of P0-NCPP0-NCP. Furthermore, under the assumption that the solution set is non-empty and bounded, we can guarantee at least one accumulation point of the generated sequence. Numerical experiments show the feasibility and efficiency of the algorithm.