Sequential quadratic programming
= Sequential quadratic programming
{wiki}
= SQP
{c}
{synonym}
Sequential quadratic programming computes steps from a quadratic model of the <optimization Lagrangian> with linearized constraints. Its constrained <Newton system> couples a primal step and multiplier estimates. A <line search> or <trust region> then controls the use of that local model.