摘要
We propose a one–step smoothing Newton method for solving the non-linearcomplementarity problem with P 0–function (P_0–NCP) based on the smoothing symmetric perturbedFisher function (for short, denoted as the SSPF–function). The proposed algorithm has to solve onlyone linear system of equations and performs only one line search per iteration. Without requiringany strict complementarity assumption at the P_0–NCP solution, we show that the proposed algorithmconverges globally and superlinearly under mild conditions. Furthermore, the algorithm has localquadratic convergence under suitable conditions. The main feature of our global convergence resultsis that we do not assume a priori the existence of an accumulation point. Compared to the previousliteratures, our algorithm has stronger convergence results under weaker conditions.
We propose a one–step smoothing Newton method for solving the non-linearcomplementarity problem with P 0–function (P_0–NCP) based on the smoothing symmetric perturbedFisher function (for short, denoted as the SSPF–function). The proposed algorithm has to solve onlyone linear system of equations and performs only one line search per iteration. Without requiringany strict complementarity assumption at the P_0–NCP solution, we show that the proposed algorithmconverges globally and superlinearly under mild conditions. Furthermore, the algorithm has localquadratic convergence under suitable conditions. The main feature of our global convergence resultsis that we do not assume a priori the existence of an accumulation point. Compared to the previousliteratures, our algorithm has stronger convergence results under weaker conditions.
基金
This work is partly supported by the National Natural Science Foundation of China(Grant,Nos.10271002,10201001)
