Sequential quadratic programming - Alchetron, the free social encyclopedia

Sequential quadratic programming (SQP) is an iterative method for nonlinear optimization. SQP methods are used on mathematical problems for which the objective function and the constraints are twice continuously differentiable.

SQP methods solve a sequence of optimization subproblems, each of which optimizes a quadratic model of the objective subject to a linearization of the constraints. If the problem is unconstrained, then the method reduces to Newton's method for finding a point where the gradient of the objective vanishes. If the problem has only equality constraints, then the method is equivalent to applying Newton's method to the first-order optimality conditions, or Karush–Kuhn–Tucker conditions, of the problem. SQP methods have been implemented in many packages, including KNITRO, NPSOL, SNOPT, NLPQL, OPSYC, OPTIMA, MATLAB, GNU Octave, SQP and SciPy.

Algorithm basics

Consider a nonlinear programming problem of the form:

min x f ( x ) s.t. b ( x ) ≥ 0 c ( x ) = 0.

The Lagrangian for this problem is;

L ( x , λ , σ ) = f ( x ) − λ T b ( x ) − σ T c ( x ) ,

where λ and σ are Lagrange multipliers. At an iterate x k , a basic sequential quadratic programming algorithm defines an appropriate search direction d k as a solution to the quadratic programming subproblem

min d f ( x k ) + ∇ f ( x k ) T d + 1 2 d T ∇ x x 2 L ( x k , λ k , σ k ) d s . t . b ( x k ) + ∇ b ( x k ) T d ≥ 0 c ( x k ) + ∇ c ( x k ) T d = 0.

Note that the term f ( x k ) in the expression above may be left out for the minimization problem, since it is constant.

References

Sequential quadratic programming Wikipedia

(Text) CC BY-SA