正在加载图片...
Semidefinite Programing (SDP) ·Given C,A,,Ak∈Rmx"andb1,b2,,bk∈R maximize 1 (cry)=∑∑c i-1 j=1 subject to tr(AY)≤b, V1≤r≤k Y≥0 symmetric Y∈Rnxn• Given C, A and 1,…, Ak ∈ ℝn×n b1, b2,…, bk ∈ ℝ Semidefinite Programing (SDP) maximize subject to , symmetric tr(CTY) = n ∑ i=1 n ∑ j=1 cij yij tr(AT r Y) ≤ br ∀1 ≤ r ≤ k Y ≽ 0 Y ∈ ℝn×n
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有