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.

90 CHAPTER 2. CONVEX GEOMETRY<br />

X<br />

X<br />

Figure 32: Truncated nonconvex cone X = {x ∈ R 2 | x 1 ≥ x 2 , x 1 x 2 ≥ 0}.<br />

Boundary is also a cone. [215,2.4] Cartesian axes drawn for reference. Each<br />

half (about the origin) is itself a convex cone.<br />

The conventional boundary of a single ray, base 0, in any dimension is<br />

the origin because that is the union of all exposed faces not containing the<br />

entire set. Its relative interior is the ray itself excluding the origin.<br />

2.7.1 Cone defined<br />

A set X is called, simply, cone if and only if<br />

Γ ∈ X ⇒ ζΓ ∈ X for all ζ ≥ 0 (156)<br />

where X denotes closure of cone X . An example of such a cone is the union<br />

of two opposing quadrants; e.g., X ={x∈ R 2 | x 1 x 2 ≥0} which is not convex.<br />

[324,2.5] Similar examples are shown in Figure 28 and Figure 32.<br />

All cones can be defined by an aggregate of rays emanating exclusively<br />

from the origin (but not all cones are convex). Hence all closed cones contain<br />

the origin and are unbounded, excepting the simplest cone {0}. The empty<br />

set ∅ is not a cone, but its conic hull is;<br />

cone ∅ ∆ = {0} (95)

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

Saved successfully!

Ooh no, something went wrong!