10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

166 CHAPTER 2. CONVEX GEOMETRY<br />

Γ 4<br />

Γ 2<br />

Γ 3<br />

K ∗<br />

x<br />

z<br />

K y<br />

Γ 1<br />

0<br />

Γ 1 ⊥ Γ 4<br />

Γ 2 ⊥ Γ 3<br />

K ∗<br />

w − K<br />

u<br />

w<br />

Figure 55: (confer Figure 139) Simplicial cone K in R 2 and its dual K ∗ drawn<br />

truncated. Conically independent generators Γ 1 and Γ 2 constitute extreme<br />

directions of K while Γ 3 and Γ 4 constitute extreme directions of K ∗ . Dotted<br />

ray-pairs bound translated cones K . Point x is comparable to point z<br />

(and vice versa) but not to y ; z ≽ K<br />

x ⇔ z − x ∈ K ⇔ z − x ≽ K<br />

0 iff ∃<br />

nonnegative coordinates for biorthogonal expansion of z − x . Point y is not<br />

comparable to z because z does not belong to y ± K . Translating a negated<br />

cone is quite helpful for visualization: u ≼ K<br />

w ⇔ u ∈ w − K ⇔ u − w ≼ K<br />

0.<br />

Points need not belong to K to be comparable; e.g., all points less than w<br />

(with respect to K) belong to w − K .

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

Saved successfully!

Ooh no, something went wrong!