Convex optimization 凸优化-英文原版书-中文译版-课件-往年考试题
2020-01-03 11:40:14
68.32MB
1
生物地理学优化算法(Biogeography-based optimization) 文章
2020-01-03 11:35:20
746KB
1
Optimization Toolbox，MATALB优化工具箱函数整理和仿真实例
2020-01-03 11:21:40
95KB
1
The Sequential Quadratic Programming (SQP) Algorithm
Given a solution estimate xk, and a small step d, an arbitrary numerical optimization problem can be approximated as follow:
f(xk+d)=f(xk)+[▽f(xk)] T*d + 1/2*(dT)[▽2f(xk)]*d+....
h(xk+d)=h(xk)+[▽h(xk)]T*d + 1/2*(dT)[▽2h(xk)]*d+.... = 0
g(xk+d)=g(xk)+[▽g(xk)]T*d + 1/2*(dT)[▽2g(xk)]*d+.... >= 0
where x=[x1,x2,…xk]T, d=[d1,d2,…dk]T
Form the linearly-constrained/quadratic minimization problem:
Minimize: f(xk)+[▽f(xk)]T*d + 1/2*(dT)[▽2f(xk)]*d
Subject to:
h(xk)+[▽h(xk)]T*d = 0;
g(xk)+[▽g(xk)]T*d >=0;
In the SQP loop, the approximate QP should be a convex Quadratic Programming, in which the matrix Q = ▽2f(xk) should be positive semidefinite, Q ≥ 0. Actually, the Q is the Hessian matrix of the function f(x) at the point xk.
2019-12-21 22:20:04
273KB
1
Numerical-Optimization 数值优化 第2版 高清版 pdf 电子书 带目录
2019-12-21 22:12:03
4.75MB
1
2017 第二版。Pyomo (Python Optimization Modeling Objects) for beginning and advanced modelers, including students at the undergraduate and graduate levels, academic researchers, and practitioners.
2019-12-21 22:10:49
2.05MB
1
清晰，滑模控制的入门经典！Utkin 1992德国斯普格林出版社出版 Sliding Modes in Control and Optimization
2019-12-21 22:10:21
11.95MB
1
MIT DIMITRI BERTSEKAS教授的Convex Optimization Theory 课程PPT,教材详细摘要和教材习题解答等。
2019-12-21 22:08:43
4.4MB
1
折中与优化——Tradeoffs and Optimization in Analog CMOS Design
2019-12-21 22:01:10
10.95MB
1