v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
56 CHAPTER 2. CONVEX GEOMETRY Ascribe the points in a list {x l ∈ R n , l=1... N} to the columns of matrix X : X = [x 1 · · · x N ] ∈ R n×N (68) In particular, we define affine dimension r of the N-point list X as dimension of the smallest affine set in Euclidean space R n that contains X ; r ∆ = dim aff X (69) Affine dimension r is a lower bound sometimes called embedding dimension. [305] [159] That affine set A in which those points are embedded is unique and called the affine hull [53,2.1.2] [286,2.1]; A ∆ = aff {x l ∈ R n , l=1... N} = aff X = x 1 + R{x l − x 1 , l=2... N} = {Xa | a T 1 = 1} ⊆ R n (70) parallel to subspace where R{x l − x 1 , l=2... N} = R(X − x 1 1 T ) ⊆ R n (71) R(A) = {Ax | ∀x} (132) Given some arbitrary set C and any x∈ C where aff(C−x) is a subspace. aff C = x + aff(C − x) (72) 2.3.1.0.1 Definition. Affine subset. We analogize affine subset to subspace, 2.14 defining it to be any nonempty affine set (2.1.4). △ aff ∅ = ∆ ∅ (73) The affine hull of a point x is that point itself; aff{x} = {x} (74) 2.14 The popular term affine subspace is an oxymoron.
2.3. HULLS 57 The affine hull of two distinct points is the unique line through them. (Figure 17) The affine hull of three noncollinear points in any dimension is that unique plane containing the points, and so on. The subspace of symmetric matrices S m is the affine hull of the cone of positive semidefinite matrices; (2.9) aff S m + = S m (75) 2.3.1.0.2 Example. Affine hull of rank-1 correlation matrices. [189] The set of all m ×m rank-1 correlation matrices is defined by all the binary vectors y in R m (confer5.9.1.0.1) {yy T ∈ S m + | δ(yy T )=1} (76) Affine hull of the rank-1 correlation matrices is equal to the set of normalized symmetric matrices; id est, aff{yy T ∈ S m + | δ(yy T )=1} = {A∈ S m | δ(A)=1} (77) 2.3.1.0.3 Exercise. Affine hull of correlation matrices. Prove (77) via definition of affine hull. Find the convex hull instead. 2.3.1.1 Partial order induced by R N + and S M + Notation a ≽ 0 means vector a belongs to the nonnegative orthant R N + , while a ≻ 0 means vector a belongs to the nonnegative orthant’s interior int R N + , whereas a ≽ b denotes comparison of vector a to vector b on R N with respect to the nonnegative orthant; id est, a ≽ b means a −b belongs to the nonnegative orthant, but neither a or b necessarily belongs to that orthant. With particular respect to the nonnegative orthant, a ≽ b ⇔ a i ≥ b i ∀i (333). More generally, a ≽ K b or a ≻ K b denotes comparison with respect to pointed closed convex cone K , but equivalence with entrywise comparison does not hold. (2.7.2.2) The symbol ≥ is reserved for scalar comparison on the real line R with respect to the nonnegative real line R + as in a T y ≥ b . Comparison of matrices with respect to the positive semidefinite cone S M + , like I ≽A ≽ 0 in Example 2.3.2.0.1, is explained in2.9.0.1.
- Page 5 and 6: for Jennie Columba ♦ Antonio ♦
- Page 7 and 8: Prelude The constant demands of my
- Page 9 and 10: Convex Optimization & Euclidean Dis
- Page 11 and 12: CONVEX OPTIMIZATION & EUCLIDEAN DIS
- Page 13 and 14: List of Figures 1 Overview 19 1 Ori
- Page 15 and 16: LIST OF FIGURES 15 3 Geometry of co
- Page 17 and 18: LIST OF FIGURES 17 126 Decomposing
- Page 19 and 20: Chapter 1 Overview Convex Optimizat
- Page 21 and 22: ˇx 4 ˇx 3 ˇx 2 Figure 2: Applica
- Page 23 and 24: 23 Figure 4: This coarsely discreti
- Page 25 and 26: ases (biorthogonal expansion). We e
- Page 27 and 28: 27 Figure 7: These bees construct a
- Page 29 and 30: that establish its membership to th
- Page 31 and 32: 31 appendices Provided so as to be
- Page 33 and 34: Chapter 2 Convex geometry Convexity
- Page 35 and 36: 2.1. CONVEX SET 35 2.1.2 linear ind
- Page 37 and 38: 2.1. CONVEX SET 37 2.1.6 empty set
- Page 39 and 40: 2.1. CONVEX SET 39 2.1.7.1 Line int
- Page 41 and 42: 2.1. CONVEX SET 41 (a) R 2 (b) R 3
- Page 43 and 44: 2.1. CONVEX SET 43 This theorem in
- Page 45 and 46: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 47 and 48: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 49 and 50: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 51 and 52: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 53 and 54: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 55: 2.3. HULLS 55 Figure 16: Convex hul
- Page 59 and 60: 2.3. HULLS 59 2.3.2 Convex hull The
- Page 61 and 62: 2.3. HULLS 61 In case k = N , the F
- Page 63 and 64: 2.3. HULLS 63 2.3.2.0.3 Exercise. C
- Page 65 and 66: 2.3. HULLS 65 Figure 20: A simplici
- Page 67 and 68: 2.4. HALFSPACE, HYPERPLANE 67 H + a
- Page 69 and 70: 2.4. HALFSPACE, HYPERPLANE 69 1 1
- Page 71 and 72: 2.4. HALFSPACE, HYPERPLANE 71 Recal
- Page 73 and 74: 2.4. HALFSPACE, HYPERPLANE 73 C H
- Page 75 and 76: 2.4. HALFSPACE, HYPERPLANE 75 2.4.2
- Page 77 and 78: 2.4. HALFSPACE, HYPERPLANE 77 (conf
- Page 79 and 80: 2.5. SUBSPACE REPRESENTATIONS 79 Ra
- Page 81 and 82: 2.5. SUBSPACE REPRESENTATIONS 81 If
- Page 83 and 84: 2.6. EXTREME, EXPOSED 83 2.6 Extrem
- Page 85 and 86: 2.6. EXTREME, EXPOSED 85 A B C D Fi
- Page 87 and 88: 2.7. CONES 87 2.6.1.3.1 Definition.
- Page 89 and 90: 2.7. CONES 89 0 Figure 30: Boundary
- Page 91 and 92: 2.7. CONES 91 2.7.2 Convex cone We
- Page 93 and 94: 2.7. CONES 93 Then a pointed closed
- Page 95 and 96: 2.7. CONES 95 A pointed closed conv
- Page 97 and 98: 2.8. CONE BOUNDARY 97 So the ray th
- Page 99 and 100: 2.8. CONE BOUNDARY 99 2.8.1.1 extre
- Page 101 and 102: 2.8. CONE BOUNDARY 101 2.8.2 Expose
- Page 103 and 104: 2.8. CONE BOUNDARY 103 From Theorem
- Page 105 and 106: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
2.3. HULLS 57<br />
The affine hull of two distinct points is the unique line through them.<br />
(Figure 17) The affine hull of three noncollinear points in any dimension<br />
is that unique plane containing the points, and so on. The subspace of<br />
symmetric matrices S m is the affine hull of the cone of positive semidefinite<br />
matrices; (2.9)<br />
aff S m + = S m (75)<br />
2.3.1.0.2 Example. Affine hull of rank-1 correlation matrices. [189]<br />
The set of all m ×m rank-1 correlation matrices is defined by all the binary<br />
vectors y in R m (confer5.9.1.0.1)<br />
{yy T ∈ S m + | δ(yy T )=1} (76)<br />
Affine hull of the rank-1 correlation matrices is equal to the set of normalized<br />
symmetric matrices; id est,<br />
aff{yy T ∈ S m + | δ(yy T )=1} = {A∈ S m | δ(A)=1} (77)<br />
2.3.1.0.3 Exercise. Affine hull of correlation matrices.<br />
Prove (77) via definition of affine hull. Find the convex hull instead. <br />
<br />
2.3.1.1 Partial order induced by R N + and S M +<br />
Notation a ≽ 0 means vector a belongs to the nonnegative orthant R N + ,<br />
while a ≻ 0 means vector a belongs to the nonnegative orthant’s<br />
interior int R N + , whereas a ≽ b denotes comparison of vector a to vector b<br />
on R N with respect to the nonnegative orthant; id est, a ≽ b means a −b<br />
belongs to the nonnegative orthant, but neither a or b necessarily belongs<br />
to that orthant. With particular respect to the nonnegative orthant,<br />
a ≽ b ⇔ a i ≥ b i ∀i (333). More generally, a ≽ K<br />
b or a ≻ K<br />
b denotes<br />
comparison with respect to pointed closed convex cone K , but equivalence<br />
with entrywise comparison does not hold. (2.7.2.2)<br />
The symbol ≥ is reserved for scalar comparison on the real line R with<br />
respect to the nonnegative real line R + as in a T y ≥ b . Comparison of<br />
matrices with respect to the positive semidefinite cone S M + , like I ≽A ≽ 0<br />
in Example 2.3.2.0.1, is explained in2.9.0.1.