Under standard regularity assumptions, it can be shown that the SQP iteration locally converges to a Karush-Kuhn-Tucker (KKT) point of the original NLP () if the Hessian approximation \(M_{yy}\)  is sufficiently accurate, cf. [1]}.
