AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY

In this paper, we propose a new sequential systems of linear equations (SSLE) filter algorithm, which is an infeasible QP-free method. The new algorithm needs to solve a few reduced systems of linear equations with the same nonsingular coefficient matrix, and after finitely many iterations, only two linear systems need to be solved. Furthermore, the nearly active set technique is used to improve the computational effect. Under the linear independence condition, the global convergence is proved. In particular, the rate of convergence is proved to be one-step superlinear without assuming the strict complementarity condition. Numerical results and comparison with other algorithms indicate that the new algorithm is promising.SSLE, line search, strict complementarity, global convergence, superlinear convergence