全部笔记的汇总贴(视频也有传送门):中科大-凸优化
一、对任意优化问题
( P ) min f 0 ( x ) s . t . f i ( x ) ≤ 0 , i = 1 , ⋯ , m ( P ∗ ) h i ( x ) = 0 , i = 1 , ⋯ , P L ( x , λ , v ) = f 0 ( x ) + ∑ i = 1 m λ i f i ( x ) + ∑ i = 1 P v i h i ( x ) g ( λ , v ) = inf x ∈ D L ( x , λ , v ) (P)\min f_0(x)\\s.t.\;f_i(x)\le0,i=1,\cdots,m\;\;\;(P^*)\\h_i(x)=0,i=1,\cdots,P\\L(x,\lambda,v)=f_0(x)+\sum_{i=1}^m\lambda_if_i(x)+\sum_{i=1}^Pv_ih_i(x)\\g(\lambda,v)=\inf_{x\in D}L(x,\lambda,v) (P)minf0(x)s.t.fi(x)≤0,i=1,⋯,m(P∗)hi(x)=0,i=1,⋯,PL(x,λ,v)=f0(x)+i=1∑mλifi(x)+i=1∑Pvihi(x)g(λ,v)=x∈DinfL(x,λ,v)
( D ) max g ( λ , v ) s . t . λ ≥ 0 R m + P d ∗ (D)\max g(\lambda,v)\\s.t.\;\lambda\ge0\\\R^{m+P}\;\;\;\;\;d^* (D)maxg(λ,v)s.t.λ≥0Rm+Pd∗
- 对偶问题一定是凸优化问题
- d ∗ ≤ P ∗ d^*\le P^* d∗≤P∗ (weak duality,一定成立)
d ∗ = P ∗ d^*=P^* d∗=P∗ (strong duality)
P ∗ − d ∗ P^*-d^* P∗−d∗ (duality gap)
D的Relative Interior(相对内部)
Relint D= { x ∈ D ∣ ∃ r > 0 , B ( x , r ) ∩ a f f D ≤ D } \{ x\in D|\exists r>0,B(x,r)\cap aff D\le D\} { x∈