We consider the inexact restoration and the composite-step
sequential quadratic programming (SQP) methods,
and relate them to the so-called perturbed SQP framework.
In particular, iterations of the methods in question
are interpreted as certain structured perturbations of the basic SQP iterations.
This gives a different insight into local behaviour of those algorithms,
as well as improved or different local convergence and rate
of convergence results.