Solving procedures for quadratic programming with optional equality and inequality constraints, which can be used for by sequential quadratic programming (SQP). Similar to Newton-Raphson methods in the unconstrained case, sequential quadratic programming solves non-linear constrained optimization problems by iteratively solving linear approximations of the optimality conditions of such a problem (cf. Powell (1978)