v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
256 CHAPTER 3. GEOMETRY OF CONVEX FUNCTIONS3.6.1.0.4 Exercise. Order of composition.Real function f =x −2 is convex on R + but not predicted so by results inExample 3.6.1.0.3 when g=h(x) −1 and h=x 2 . Explain this anomaly. The following result for product of real functions is extensible to innerproduct of multidimensional functions on real domain:3.6.1.0.5 Exercise. Product and ratio of convex functions. [61, exer.3.32]In general the product or ratio of two convex functions is not convex. [230]However, there are some results that apply to functions on R [real domain].Prove the following. 3.20(a) If f and g are convex, both nondecreasing (or nonincreasing), andpositive functions on an interval, then fg is convex.(b) If f , g are concave, positive, with one nondecreasing and the othernonincreasing, then fg is concave.(c) If f is convex, nondecreasing, and positive, and g is concave,nonincreasing, and positive, then f/g is convex.3.6.2 first-order convexity condition, real functionDiscretization of w ≽0 in (498) invites refocus to the real-valued function:3.6.2.0.1 Theorem. Necessary and sufficient convexity condition.[61,3.1.3] [132,I.5.2] [391,1.2.3] [42,1.2] [330,4.2] [306,3]For real differentiable function f(X) : R p×k →R with matrix argument onopen convex domain, the condition (conferD.1.7)f(Y ) ≥ f(X) + 〈∇f(X) , Y − X〉 for each and every X,Y ∈ domf (607)is necessary and sufficient for convexity of f . Caveat Y ≠ X and strictinequality again provide necessary and sufficient conditions for strictconvexity. [199,B.4.1.1]⋄3.20 Hint: Prove3.6.1.0.5a by verifying Jensen’s inequality ((497) at µ= 1 2 ).
3.6. GRADIENT 257f(Y )[ ∇f(X)−1]∂H −Figure 77: When a real function f is differentiable at each point in its opendomain, there is an intuitive geometric interpretation of function convexity interms of its gradient ∇f and its epigraph: Drawn is a convex quadratic bowlin R 2 ×R (confer Figure 160, p.680); f(Y )= Y T Y : R 2 → R versus Y onsome open disc in R 2 . Unique strictly supporting hyperplane ∂H − ⊂ R 2 × R(only partially drawn) and its normal vector [ ∇f(X) T −1 ] T at theparticular point of support [X T f(X) ] T are illustrated. The interpretation:At each and every coordinate Y , there is a unique hyperplane containing[Y T f(Y ) ] T and supporting the epigraph of convex differentiable f .
- 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 and 240: 3.4. AFFINE FUNCTION 239f(z)Az 2z 1
- Page 241 and 242: 3.5. EPIGRAPH, SUBLEVEL SET 241{a T
- 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: 3.6. GRADIENT 2553.6.1.0.2 Theorem.
- 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
- Page 291 and 292: 4.2. FRAMEWORK 291For symmetric pos
- Page 293 and 294: 4.2. FRAMEWORK 293has norm ‖x ⋆
- Page 295 and 296: 4.2. FRAMEWORK 295minimize 1 TˆxX
- Page 297 and 298: 4.2. FRAMEWORK 297asminimize ‖ỹ
- Page 299 and 300: 4.3. RANK REDUCTION 2994.3 Rank red
- Page 301 and 302: 4.3. RANK REDUCTION 301A rank-reduc
- Page 303 and 304: 4.3. RANK REDUCTION 303(t ⋆ i)
- Page 305 and 306: 4.3. RANK REDUCTION 3054.3.3.0.1 Ex
3.6. GRADIENT 257f(Y )[ ∇f(X)−1]∂H −Figure 77: When a real function f is differentiable at each point in its opendomain, there is an intuitive geometric interpretation of function convexity interms of its gradient ∇f and its epigraph: Drawn is a convex quadratic bowlin R 2 ×R (confer Figure 160, p.680); f(Y )= Y T Y : R 2 → R versus Y onsome open disc in R 2 . Unique strictly supporting hyperplane ∂H − ⊂ R 2 × R(only partially drawn) and its normal vector [ ∇f(X) T −1 ] T at theparticular point of support [X T f(X) ] T are illustrated. The interpretation:At each and every coordinate Y , there is a unique hyperplane containing[Y T f(Y ) ] T and supporting the epigraph of convex differentiable f .