v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
156 CHAPTER 2. CONVEX GEOMETRYof conic problems. [391] [277,4.5] For unique minimum-distance projectionon a closed convex cone K , the negative dual cone −K ∗ plays the role thatorthogonal complement plays for subspace projection. 2.58 (E.9.2.1) Indeed,−K ∗ is the algebraic complement in R n ;K ⊞ −K ∗ = R n (2023)where ⊞ denotes unique orthogonal vector sum.One way to think of a pointed closed convex cone is as a new kind ofcoordinate system whose basis is generally nonorthogonal; a conic system,very much like the familiar Cartesian system whose analogous cone is thefirst quadrant (the nonnegative orthant). Generalized inequality ≽ K is aformalized means to determine membership to any pointed closed convexcone K (2.7.2.2) whereas biorthogonal expansion is, fundamentally, anexpression of coordinates in a pointed conic system whose axes are linearlyindependent but not necessarily orthogonal. When cone K is the nonnegativeorthant, then these three concepts come into alignment with the Cartesianprototype: biorthogonal expansion becomes orthogonal expansion, the dualcone becomes identical to the orthant, and generalized inequality obeys atotal order entrywise.2.13.1 Dual coneFor any set K (convex or not), the dual cone [109,4.2]K ∗ {y ∈ R n | 〈y , x〉 ≥ 0 for all x ∈ K} (297)is a unique cone 2.59 that is always closed and convex because it is anintersection of halfspaces (2.4.1.1.1). Each halfspace has inward-normal x ,belonging to K , and boundary containing the origin; e.g., Figure 55a.When cone K is convex, there is a second and equivalent construction:Dual cone K ∗ is the union of each and every vector y inward-normalto a hyperplane supporting K (2.4.2.6.1); e.g., Figure 55b. When K is2.58 Namely, projection on a subspace is ascertainable from projection on its orthogonalcomplement (Figure 165).2.59 The dual cone is the negative polar cone defined by many authors; K ∗ = −K ◦ .[199,A.3.2] [307,14] [41] [26] [330,2.7]
2.13. DUAL CONE & GENERALIZED INEQUALITY 157represented by a halfspace-description such as (287), for example, where⎡a T1 ⎤⎡c T1A ⎣ . ⎦∈ R m×n , C ⎣ .⎤⎦∈ R p×n (298)a T mc T pthen the dual cone can be represented as the conic hullK ∗ = cone{a 1 ,..., a m , ±c 1 ,..., ±c p } (299)a vertex-description, because each and every conic combination of normalsfrom the halfspace-description of K yields another inward-normal to ahyperplane supporting K .K ∗ can also be constructed pointwise using projection theory fromE.9.2:for P K x the Euclidean projection of point x on closed convex cone K−K ∗ = {x − P K x | x∈ R n } = {x∈ R n | P K x = 0} (2024)2.13.1.0.1 Exercise. Manual dual cone construction.Perhaps the most instructive graphical method of dual cone construction iscut-and-try. Find the dual of each polyhedral cone from Figure 56 by usingdual cone equation (297).2.13.1.0.2 Exercise. Dual cone definitions.What is {x∈ R n | x T z ≥0 ∀z∈R n } ?What is {x∈ R n | x T z ≥1 ∀z∈R n } ?What is {x∈ R n | x T z ≥1 ∀z∈R n +} ?As defined, dual cone K ∗ exists even when the affine hull of the originalcone is a proper subspace; id est, even when the original cone is notfull-dimensional. 2.60To further motivate our understanding of the dual cone, consider theease with which convergence can be ascertained in the following optimizationproblem (302p):2.60 Rockafellar formulates dimension of K and K ∗ . [307,14.6.1] His monumental workConvex Analysis has not one figure or illustration. See [26,II.16] for a good illustrationof Rockafellar’s recession cone [42].
- 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
- Page 145 and 146: 2.10. CONIC INDEPENDENCE (C.I.) 145
- Page 147 and 148: 2.12. CONVEX POLYHEDRA 147all dimen
- Page 149 and 150: 2.12. CONVEX POLYHEDRA 149convex po
- Page 151 and 152: 2.12. CONVEX POLYHEDRA 1512.12.2.2
- Page 153 and 154: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 155: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 159 and 160: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 161 and 162: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 163 and 164: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 165 and 166: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 167 and 168: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 169 and 170: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 171 and 172: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 173 and 174: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 175 and 176: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 177 and 178: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 179 and 180: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 181 and 182: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 183 and 184: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 185 and 186: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 187 and 188: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 189 and 190: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 191 and 192: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 193 and 194: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 195 and 196: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 197 and 198: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 199 and 200: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 201 and 202: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 203 and 204: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 205 and 206: 2.13. DUAL CONE & GENERALIZED INEQU
2.13. DUAL CONE & GENERALIZED INEQUALITY 157represented by a halfspace-description such as (287), for example, where⎡a T1 ⎤⎡c T1A ⎣ . ⎦∈ R m×n , C ⎣ .⎤⎦∈ R p×n (298)a T mc T pthen the dual cone can be represented as the conic hullK ∗ = cone{a 1 ,..., a m , ±c 1 ,..., ±c p } (299)a vertex-description, because each and every conic combination of normalsfrom the halfspace-description of K yields another inward-normal to ahyperplane supporting K .K ∗ can also be constructed pointwise using projection theory fromE.9.2:for P K x the Euclidean projection of point x on closed convex cone K−K ∗ = {x − P K x | x∈ R n } = {x∈ R n | P K x = 0} (2024)2.13.1.0.1 Exercise. Manual dual cone construction.Perhaps the most instructive graphical method of dual cone construction iscut-and-try. Find the dual of each polyhedral cone from Figure 56 by usingdual cone equation (297).2.13.1.0.2 Exercise. Dual cone definitions.What is {x∈ R n | x T z ≥0 ∀z∈R n } ?What is {x∈ R n | x T z ≥1 ∀z∈R n } ?What is {x∈ R n | x T z ≥1 ∀z∈R n +} ?As defined, dual cone K ∗ exists even when the affine hull of the originalcone is a proper subspace; id est, even when the original cone is notfull-dimensional. 2.60To further motivate our understanding of the dual cone, consider theease with which convergence can be ascertained in the following optimizationproblem (302p):2.60 Rockafellar formulates dimension of K and K ∗ . [307,14.6.1] His monumental work<strong>Convex</strong> Analysis has not one figure or illustration. See [26,II.16] for a good illustrationof Rockafellar’s recession cone [42].