A globally and superlinearly convergent feasible QP-free method for nonlinear programming

In this paper, we propose a QP-free type algorithm which solves the problem of minimizing a smooth function subject to smooth inequality constraints. In contrast with the SQP methods, each iteration this algorithm only needs to solve systems of linear equations which are derived from the equality pa...

Ausführliche Beschreibung