A Filter-SSLE Algorithm for Solving Nonlinear Complementarity Problems

In this paper, we aim to solve nonlinear complementarity problems(NCP), NCP can be reformulated as a nonlinear programming. A search direction is obtained by linearization of the feasible set at a trial point, by making use of this method, a new filter-SSLE Algorithm is presented. It only needs to solve two linear equations at each iteration, fewer computations are required. Global convergence results of the proposed algorithm are established under some suitable conditions.