We present a sequential quadratic programming (SQP) algorithm for nonlinear optimization. We give a brief overview of SQP methods in general and then describe an active-set method based on inertia control for solving the convex quadratic subproblems. We also discuss the motivation behind this algorithm as well as its applications.