An infeasible nonmonotone SSLE algorithm for nonlinear programming

Abstract

In this paper, we propose a new nonmonotone algorithm using the sequential systems of linear equations, which is an infeasible QP-free method. We use neither a penalty function nor a filter. Therefore, it is unnecessary to choose a problematic penalty parameter. The new algorithm only needs to solve three systems of linear equations with the same nonsingular coefficient matrix. Under some suitable conditions, the global convergence is established. Some numerical results are also presented.