A stabilized SQP method: superlinear convergence (Q526843)

The authors concider the local convergence analysis of an stabilized sequential quadratic programming (sSQP) method that uses a linear search with a primal-dual augmented Lagrangian merit function to enforce global convergence. It is shown that the given method has superlinear local convergence under assumptions that are not stronger than those required by conventional stabilized SOP methods. Numerical experiments for the given method are presented.