请输入您要查询的百科知识:

 

词条 Sequential linear-quadratic programming
释义

  1. Algorithm basics

      LP phase    EQP phase  

  2. See also

  3. Notes

  4. References

{{refimprove|date=November 2017}}

Sequential linear-quadratic programming (SLQP) is an iterative method for nonlinear optimization problems where objective function and constraints are twice continuously differentiable. Similarly to sequential quadratic programming (SQP), SLQP proceeds by solving a sequence of optimization subproblems. The difference between the two approaches is that:

  • in SQP, each subproblem is a quadratic program, with a quadratic model of the objective subject to a linearization of the constraints
  • in SLQP, two subproblems are solved at each step: a linear program (LP) used to determine an active set, followed by an equality-constrained quadratic program (EQP) used to compute the total step

This decomposition makes SLQP suitable to large-scale optimization problems, for which efficient LP and EQP solvers are available, these problems being easier to scale than full-fledge quadratic programs.

Algorithm basics

Consider a nonlinear programming problem of the form:

The Lagrangian for this problem is[1]

where and are Lagrange multipliers.

LP phase

In the LP phase of SLQP, the following linear program is solved:

Let denote the active set at the optimum of this problem, that is to say, the set of constraints that are equal to zero at . Denote by and the sub-vectors of and corresponding to elements of .

EQP phase

In the EQP phase of SLQP, the search direction of the step is obtained by solving the following quadratic program:

Note that the term in the objective functions above may be left out for the minimization problems, since it is constant.

See also

  • Newton's method
  • Secant method
  • Sequential linear programming
  • Sequential quadratic programming

Notes

1. ^{{ cite book | year=2006|url=http://www.ece.northwestern.edu/~nocedal/book/num-opt.html| title= Numerical Optimization| publisher=Springer.|isbn=0-387-30303-0| author=Jorge Nocedal and Stephen J. Wright}}

References

  • {{ cite book | year=2006|url=http://www.ece.northwestern.edu/~nocedal/book/num-opt.html| title= Numerical Optimization| publisher=Springer.|isbn=0-387-30303-0| author=Jorge Nocedal and Stephen J. Wright}}
{{optimization algorithms}}{{Mathapplied-stub}}

1 : Optimization algorithms and methods

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/9/22 23:36:50