v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
10.03.2015 Views

106 CHAPTER 2. CONVEX GEOMETRY γ svec ∂ S 2 + [ α β β γ ] α √ 2β Minimal set of generators are the extreme directions: svec{yy T | y ∈ R M } Figure 37: Truncated boundary of PSD cone in S 2 plotted in isometrically isomorphic R 3 via svec (49); courtesy, Alexandre W. d’Aspremont. (Plotted is 0-contour of smallest eigenvalue (175). Lightest shading is closest. Darkest shading is furthest and inside shell.) Entire boundary can be constructed from an aggregate of rays (2.7.0.0.1) emanating exclusively from the origin, { √ κ 2 [z1 2 2z1 z 2 z2 2 ] T | κ∈ R } . In this dimension the cone is circular (2.9.2.5) while each and every ray on boundary corresponds to an extreme direction, but such is not the case in any higher dimension (confer Figure 20). PSD cone geometry is not as simple in higher dimensions [25,II.12], although for real matrices it is self-dual (334) in ambient space of symmetric matrices. [170,II] PSD cone has no two-dimensional faces in any dimension, and its only extreme point resides at the origin.

2.9. POSITIVE SEMIDEFINITE (PSD) CONE 107 C X Figure 38: Convex set C ={X ∈ S × x∈ R | X ≽ xx T } drawn truncated. x id est, for A 1 , A 2 ≽ 0 and each and every ζ 1 , ζ 2 ≥ 0 ζ 1 x T A 1 x + ζ 2 x T A 2 x ≥ 0 for each and every normalized x ∈ R M (179) The convex cone S M + is more easily visualized in the isomorphic vector space R M(M+1)/2 whose dimension is the number of free variables in a symmetric M ×M matrix. When M = 2 the PSD cone is semi-infinite in expanse in R 3 , having boundary illustrated in Figure 37. When M = 3 the PSD cone is six-dimensional, and so on. 2.9.1.0.1 Example. Sets from maps of positive semidefinite cone. The set C = {X ∈ S n × x∈ R n | X ≽ xx T } (180) is convex because it has Schur-form; (A.4) X − xx T ≽ 0 ⇔ f(X , x) ∆ = [ X x x T 1 ] ≽ 0 (181) e.g., Figure 38. Set C is the inverse image (2.1.9.0.1) of S n+1 + under the affine mapping f . The set {X ∈ S n × x∈ R n | X ≼ xx T } is not convex, in contrast, having no Schur-form. Yet for fixed x = x p , the set {X ∈ S n | X ≼ x p x T p } (182) is simply the negative semidefinite cone shifted to x p x T p .

106 CHAPTER 2. CONVEX GEOMETRY<br />

γ<br />

svec ∂ S 2 +<br />

[ α β<br />

β γ<br />

]<br />

α<br />

√<br />

2β<br />

Minimal set of generators are the extreme directions: svec{yy T | y ∈ R M }<br />

Figure 37: Truncated boundary of PSD cone in S 2 plotted in isometrically<br />

isomorphic R 3 via svec (49); courtesy, Alexandre W. d’Aspremont. (Plotted<br />

is 0-contour of smallest eigenvalue (175). Lightest shading is closest.<br />

Darkest shading is furthest and inside shell.) Entire boundary can be<br />

constructed from an aggregate of rays (2.7.0.0.1) emanating exclusively<br />

from the origin, { √<br />

κ 2 [z1<br />

2 2z1 z 2 z2 2 ] T | κ∈ R } . In this dimension the cone<br />

is circular (2.9.2.5) while each and every ray on boundary corresponds to<br />

an extreme direction, but such is not the case in any higher dimension<br />

(confer Figure 20). PSD cone geometry is not as simple in higher dimensions<br />

[25,II.12], although for real matrices it is self-dual (334) in ambient space<br />

of symmetric matrices. [170,II] PSD cone has no two-dimensional faces in<br />

any dimension, and its only extreme point resides at the origin.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!