v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
94 CHAPTER 2. CONVEX GEOMETRYABCDFigure 32: Closed convex set in R 2 . Point A is exposed hence extreme;a classical vertex. Point B is extreme but not an exposed point. Point Cis exposed and extreme; zero-dimensional exposure makes it a vertex.Point D is neither an exposed or extreme point although it belongs to aone-dimensional exposed face. [199,A.2.4] [330,3.6] Closed face AB isexposed; a facet. The arc is not a conventional face, yet it is composedentirely of extreme points. Union of all rotations of this entire set aboutits vertical edge produces another convex set in three dimensions havingno edges; but that convex set produced by rotation about horizontal edgecontaining D has edges.
2.6. EXTREME, EXPOSED 952.6.1.1 Density of exposed pointsFor any closed convex set C , its exposed points constitute a dense subset ofits extreme points; [307,18] [335] [330,3.6, p.115] dense in the sense [373]that closure of that subset yields the set of extreme points.For the convex set illustrated in Figure 32, point B cannot be exposedbecause it relatively bounds both the facet AB and the closed quarter circle,each bounding the set. Since B is not relatively interior to any line segmentin the set, then B is an extreme point by definition. Point B may be regardedas the limit of some sequence of exposed points beginning at vertex C .2.6.1.2 Face transitivity and algebraFaces of a convex set enjoy transitive relation. If F 1 is a face (an extreme set)of F 2 which in turn is a face of F 3 , then it is always true that F 1 is aface of F 3 . (The parallel statement for exposed faces is false. [307,18])For example, any extreme point of F 2 is an extreme point of F 3 ; inthis example, F 2 could be a face exposed by a hyperplane supportingpolyhedron F 3 . [223, def.115/6 p.358] Yet it is erroneous to presume thata face, of dimension 1 or more, consists entirely of extreme points. Nor is aface of dimension 2 or more entirely composed of edges, and so on.For the polyhedron in R 3 from Figure 20, for example, the nonemptyfaces exposed by a hyperplane are the vertices, edges, and facets; thereare no more. The zero-, one-, and two-dimensional faces are in one-to-onecorrespondence with the exposed faces in that example.2.6.1.3 Smallest faceDefine the smallest face F , that contains some element G , of a convex set C :F(C ∋G) (171)videlicet, C ⊃ rel int F(C ∋G) ∋ G . An affine set has no faces except itselfand the empty set. The smallest face, that contains G , of the intersectionof convex set C with an affine set A [239,2.4] [240]F((C ∩ A)∋G) = F(C ∋G) ∩ A (172)equals the intersection of A with the smallest face, that contains G , of set C .
- Page 43 and 44: 2.1. CONVEX SET 43where Q∈ R 3×3
- Page 45 and 46: 2.1. CONVEX SET 45Now let’s move
- Page 47 and 48: 2.1. CONVEX SET 47By additive inver
- Page 49 and 50: 2.1. CONVEX SET 49R nR mR(A T )x px
- Page 51 and 52: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 53 and 54: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 55 and 56: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 57 and 58: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 59 and 60: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 61 and 62: 2.3. HULLS 61Figure 20: Convex hull
- Page 63 and 64: 2.3. HULLS 63Aaffine hull (drawn tr
- Page 65 and 66: 2.3. HULLS 65subset of the affine h
- Page 67 and 68: 2.3. HULLS 672.3.2.0.2 Example. Nuc
- Page 69 and 70: 2.3. HULLS 692.3.2.0.3 Exercise. Co
- Page 71 and 72: 2.3. HULLS 71Figure 24: A simplicia
- Page 73 and 74: 2.4. HALFSPACE, HYPERPLANE 73H + =
- Page 75 and 76: 2.4. HALFSPACE, HYPERPLANE 7511−1
- Page 77 and 78: 2.4. HALFSPACE, HYPERPLANE 772.4.2.
- Page 79 and 80: 2.4. HALFSPACE, HYPERPLANE 792.4.2.
- Page 81 and 82: 2.4. HALFSPACE, HYPERPLANE 81tradit
- Page 83 and 84: 2.4. HALFSPACE, HYPERPLANE 832.4.2.
- Page 85 and 86: 2.5. SUBSPACE REPRESENTATIONS 852.5
- Page 87 and 88: 2.5. SUBSPACE REPRESENTATIONS 87(Ex
- Page 89 and 90: 2.5. SUBSPACE REPRESENTATIONS 89(a)
- Page 91 and 92: 2.5. SUBSPACE REPRESENTATIONS 91are
- Page 93: 2.6. EXTREME, EXPOSED 93A one-dimen
- Page 97 and 98: 2.7. CONES 97X(a)00(b)XFigure 33: (
- Page 99 and 100: 2.7. CONES 99XXFigure 37: Truncated
- Page 101 and 102: 2.7. CONES 101Figure 39: Not a cone
- Page 103 and 104: 2.7. CONES 103cone that is a halfli
- Page 105 and 106: 2.7. CONES 105A pointed closed conv
- Page 107 and 108: 2.8. CONE BOUNDARY 107That means th
- Page 109 and 110: 2.8. CONE BOUNDARY 1092.8.1.1 extre
- Page 111 and 112: 2.8. CONE BOUNDARY 1112.8.2 Exposed
- Page 113 and 114: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 115 and 116: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 117 and 118: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 119 and 120: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 121 and 122: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 123 and 124: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 125 and 126: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 127 and 128: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 129 and 130: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 131 and 132: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 133 and 134: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 135 and 136: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 137 and 138: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 139 and 140: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 141 and 142: 2.10. CONIC INDEPENDENCE (C.I.) 141
- Page 143 and 144: 2.10. CONIC INDEPENDENCE (C.I.) 143
94 CHAPTER 2. CONVEX GEOMETRYABCDFigure 32: Closed convex set in R 2 . Point A is exposed hence extreme;a classical vertex. Point B is extreme but not an exposed point. Point Cis exposed and extreme; zero-dimensional exposure makes it a vertex.Point D is neither an exposed or extreme point although it belongs to aone-dimensional exposed face. [199,A.2.4] [330,3.6] Closed face AB isexposed; a facet. The arc is not a conventional face, yet it is composedentirely of extreme points. Union of all rotations of this entire set aboutits vertical edge produces another convex set in three dimensions havingno edges; but that convex set produced by rotation about horizontal edgecontaining D has edges.