序列二次规划.ppt
《序列二次规划.ppt》由会员分享,可在线阅读,更多相关《序列二次规划.ppt(151页珍藏版)》请在三一文库上搜索。
1、二次规划 Quadratic Programming,二次规划,Questions,什么是二次规划? 如何求解?,二次规划,Definition,二次规划,(*),二次规划,二次规划,Remark,二次规划,等式约束二次规划问题的解法: 直接消去法(Direct Elimination Method) Lagrange乘子法,直接消去法(Direct Elimination Method),直接消去法,直接消去法,直接消去法,(*),直接消去法,直接消去法,直接消去法,Remark,直接消去法,Example,直接消去法,Solution,直接消去法,直接消去法,直接消去法,Remark,La
2、grange乘子法,Lagrange乘子法,Lagrange乘子法,Lagrange乘子法,Lagrange乘子法,把c和b代入前面的最优解然后利用H R即可得。,Lagrange乘子法,Example,Lagrange乘子法,Solution,Lagrange乘子法,Lagrange乘子法,起作用集方法(Active Set Method),起作用集方法,正定二次规划,(*),定 理,起作用集方法,Theorem,起作用集方法,Theorem,(*),起作用集方法,Proof,起作用集方法,(a),起作用集方法,(b),满足(a)的 肯定满足(b),且为满足(b)的 的一部分,但满足(b)的
3、解是唯一的,所以问题(b)的解就是问题(a)的解。,起作用集方法,Remark,起作用集方法,Questions,起作用集方法,起作用集方法,(*),起作用集方法,起作用集方法,(*),起作用集方法,起作用集方法,起作用集方法,起作用集方法,Questions,如何得到(*)?,起作用集方法,Answer,起作用集方法,Questions,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,Algorithm,Algorithm,Algorithm,Algorithm,起作用集方法,起作用集方法,起作用集方法,起作用集方法,Example,起作用集方法,Solution,起作
4、用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,起作用集方法,序列二次规划法 (Sequential Quadratic Programming),(约束拟牛顿法 约束变尺度法),序列二次规划法,序列二次规划法,序列二次规划法,序列二次规划法,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解,牛顿法求方程组 的解
5、,牛顿法求方程组 的解,牛顿法求方程组 的解,序列二次规划法,序列二次规划法,序列二次规划法,Remark,序列二次规划法,Remark,序列二次规划法,Example,序列二次规划法,序列二次规划法,序列二次规划法,序列二次规划法,序列二次规划法,用信赖域方法求解二次规划子问题:,序列二次规划法,序列二次规划法,序列二次规划法,(*),序列二次规划法,序列二次规划法,序列二次规划法,序列二次规划法,序列二次规划法,序列二次规划法,(1),General Problem (GP),序列二次规划法,In constrained optimization, the general aim is t
6、o transform the problem into an easier sub-problem that can then be solved and used as the basis of an iterative process.,序列二次规划法,A characteristic of a large class of early methods is the translation of the constrained problem to a basic unconstrained problem by using a penalty function for constrai
7、nts that are near or beyond the constraint boundary. In this way the constrained problem is solved using a sequence of parameterized unconstrained optimizations, which in the limit (of the sequence) converge to the constrained problem.,序列二次规划法,These methods are now considered relatively inefficient
8、and have been replaced by methods that have focused on the solution of the Kuhn-Tucker (KT) equations. The KT equations are necessary conditions for optimality for a constrained optimization problem.,序列二次规划法,If the problem is a so-called convex programming problem, then the KT equations are both nec
9、essary and sufficient for a global solution point.,序列二次规划法,Referring to GP (1), the Kuhn-Tucker equations can be stated as,(2),序列二次规划法,The first equation describes a canceling of the gradients between the objective function and the active constraints at the solution point. For the gradients to be ca
10、nceled, Lagrange multipliers are necessary to balance the deviations in magnitude of the objective function and constraint gradients.,序列二次规划法,Because only active constraints are included in this canceling operation, constraints that are not active must not be included in this operation and so are gi
11、ven Lagrange multipliers equal to zero. This is stated implicitly in the last two equations of Eq. (2).,序列二次规划法,The solution of the KT equations forms the Basis to many nonlinear programming algorithms. These algorithms attempt to compute the Lagrange multipliers directly. Constrained quasi-Newton m
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 序列 二次 规划
链接地址:https://www.31doc.com/p-2852290.html