词条 | Sequential linear-quadratic programming |
释义 |
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:
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 basicsConsider a nonlinear programming problem of the form: The Lagrangian for this problem is[1] where and are Lagrange multipliers. LP phaseIn 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 phaseIn 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
Notes1. ^{{ 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
1 : Optimization algorithms and methods |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。