v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
240 CHAPTER 3. GEOMETRY OF CONVEX FUNCTIONSconvex set C an intersection with a positive semidefinite cone, then thisproblem would be called a semidefinite program.There are two distinct ways to visualize this problem: one in the objectivefunction’s domain R 2 ,[ the]other including the ambient space of the objectiveR2function’s range as in . Both visualizations are illustrated in Figure 73.RVisualization in the function domain is easier because of lower dimension andbecauselevel sets (555) of any affine function are affine. (2.1.9)In this circumstance, the level sets are parallel hyperplanes with respectto R 2 . One solves optimization problem (552) graphically by finding thathyperplane intersecting feasible set C furthest right (in the direction ofnegative gradient −a (3.6)).When a differentiable convex objective function f is nonlinear, thenegative gradient −∇f is a viable search direction (replacing −a in (552)).(2.13.10.1, Figure 67) [152] Then the nonlinear objective function can bereplaced with a dynamic linear objective; linear as in (552).3.4.0.0.3 Example. Support function. [199,C.2.1-C.2.3.1]For arbitrary set Y ⊆ R n , its support function σ Y (a) : R n → R is definedσ Y (a) supa T z (553)z∈Ya positively homogeneous function of direction a whose range contains ±∞.[250, p.135] For each z ∈ Y , a T z is a linear function of vector a . Becauseσ Y (a) is a pointwise supremum of linear functions, it is convex in a(Figure 74). Application of the support function is illustrated in Figure 29afor one particular normal a . Given nonempty closed bounded convex sets Yand Z in R n and nonnegative scalars β and γ [371, p.234]σ βY+γZ (a) = βσ Y (a) + γσ Z (a) (554)3.4.0.0.4 Exercise. Level sets.Given a function f and constant κ , its level sets are definedL κ κf {z | f(z)=κ} (555)
3.5. EPIGRAPH, SUBLEVEL SET 241{a T z 1 + b 1 | a∈ R}supa T pz i + b ii{a T z 2 + b 2 | a∈ R}{a T z 3 + b 3 | a∈ R}a{a T z 4 + b 4 | a∈ R}{a T z 5 + b 5 | a∈ R}Figure 74: Pointwise supremum of convex functions remains convex; byepigraph intersection. Supremum of affine functions in variable a evaluatedat argument a p is illustrated. Topmost affine function per a is supremum.Give two distinct examples of convex function, that are not affine, havingconvex level sets.3.4.0.0.5 Exercise. Epigraph intersection. (confer Figure 74)Draw three hyperplanes in R 3 representing max(0,x) sup{0,x i | x∈ R n }in R 2 ×R to see why maximum of nonnegative vector entries is a convexfunction of variable x . What is the normal to each hyperplane? 3.15 Why ismax(x) convex?3.5 Epigraph, Sublevel setIt is well established that a continuous real function is convex if andonly if its epigraph makes a convex set; [199] [307] [358] [371] [250]epigraph is the connection between convex sets and convex functions(p.219). Piecewise-continuous convex functions are admitted, thereby, and3.15 Hint: page 258.
- 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
- Page 207 and 208: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 209 and 210: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 211 and 212: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 213 and 214: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 215 and 216: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 217 and 218: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 219 and 220: Chapter 3Geometry of convex functio
- Page 221 and 222: 3.1. CONVEX FUNCTION 221f 1 (x)f 2
- Page 223 and 224: 3.1. CONVEX FUNCTION 223Rf(b)f(X
- Page 225 and 226: 3.2. PRACTICAL NORM FUNCTIONS, ABSO
- Page 227 and 228: 3.2. PRACTICAL NORM FUNCTIONS, ABSO
- Page 229 and 230: 3.2. PRACTICAL NORM FUNCTIONS, ABSO
- Page 231 and 232: 3.2. PRACTICAL NORM FUNCTIONS, ABSO
- Page 233 and 234: 3.2. PRACTICAL NORM FUNCTIONS, ABSO
- Page 235 and 236: 3.3. INVERTED FUNCTIONS AND ROOTS 2
- Page 237 and 238: 3.4. AFFINE FUNCTION 237rather]x >
- Page 239: 3.4. AFFINE FUNCTION 239f(z)Az 2z 1
- Page 243 and 244: 3.5. EPIGRAPH, SUBLEVEL SET 243Subl
- Page 245 and 246: 3.5. EPIGRAPH, SUBLEVEL SET 245wher
- Page 247 and 248: 3.5. EPIGRAPH, SUBLEVEL SET 247part
- Page 249 and 250: 3.5. EPIGRAPH, SUBLEVEL SET 249that
- Page 251 and 252: 3.6. GRADIENT 251respect to its vec
- Page 253 and 254: 3.6. GRADIENT 253Invertibility is g
- Page 255 and 256: 3.6. GRADIENT 2553.6.1.0.2 Theorem.
- Page 257 and 258: 3.6. GRADIENT 257f(Y )[ ∇f(X)−1
- Page 259 and 260: 3.6. GRADIENT 259αβα ≥ β ≥
- Page 261 and 262: 3.6. GRADIENT 2613.6.4 second-order
- Page 263 and 264: 3.7. CONVEX MATRIX-VALUED FUNCTION
- Page 265 and 266: 3.7. CONVEX MATRIX-VALUED FUNCTION
- Page 267 and 268: 3.7. CONVEX MATRIX-VALUED FUNCTION
- Page 269 and 270: 3.8. QUASICONVEX 269exponential alw
- Page 271 and 272: 3.9. SALIENT PROPERTIES 2713.8.0.0.
- Page 273 and 274: Chapter 4Semidefinite programmingPr
- Page 275 and 276: 4.1. CONIC PROBLEM 275(confer p.162
- Page 277 and 278: 4.1. CONIC PROBLEM 277PCsemidefinit
- Page 279 and 280: 4.1. CONIC PROBLEM 279is the affine
- Page 281 and 282: 4.1. CONIC PROBLEM 281faces of S 3
- Page 283 and 284: 4.1. CONIC PROBLEM 2834.1.2.3 Previ
- Page 285 and 286: 4.2. FRAMEWORK 285Semidefinite Fark
- Page 287 and 288: 4.2. FRAMEWORK 287On the other hand
- Page 289 and 290: 4.2. FRAMEWORK 2894.2.2.1 Dual prob
3.5. EPIGRAPH, SUBLEVEL SET 241{a T z 1 + b 1 | a∈ R}supa T pz i + b ii{a T z 2 + b 2 | a∈ R}{a T z 3 + b 3 | a∈ R}a{a T z 4 + b 4 | a∈ R}{a T z 5 + b 5 | a∈ R}Figure 74: Pointwise supremum of convex functions remains convex; byepigraph intersection. Supremum of affine functions in variable a evaluatedat argument a p is illustrated. Topmost affine function per a is supremum.Give two distinct examples of convex function, that are not affine, havingconvex level sets.3.4.0.0.5 Exercise. Epigraph intersection. (confer Figure 74)Draw three hyperplanes in R 3 representing max(0,x) sup{0,x i | x∈ R n }in R 2 ×R to see why maximum of nonnegative vector entries is a convexfunction of variable x . What is the normal to each hyperplane? 3.15 Why ismax(x) convex?3.5 Epigraph, Sublevel setIt is well established that a continuous real function is convex if andonly if its epigraph makes a convex set; [199] [307] [358] [371] [250]epigraph is the connection between convex sets and convex functions(p.219). Piecewise-continuous convex functions are admitted, thereby, and3.15 Hint: page 258.