v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
270 CHAPTER 3. GEOMETRY OF CONVEX FUNCTIONSFigure 79: Iconic unimodal differentiable quasiconvex function of twovariables graphed in R 2 × R on some open disc in R 2 . Note reversal ofcurvature in direction of gradient.Unlike convex functions, quasiconvex functions are not necessarilycontinuous; e.g., quasiconcave rank(X) on S M + (2.9.2.9.2) and card(x)on R M + . Although insufficient for convex functions, convexity of each andevery sublevel set serves as a definition of quasiconvexity:3.8.0.0.2 Definition. Quasiconvex multidimensional function.Scalar-, vector-, or matrix-valued function g(X) : R p×k →S M is a quasiconvexfunction of matrix X iff domg is a convex set and the sublevel setcorresponding to each and every S ∈ S ML Sg = {X ∈ dom g | g(X) ≼ S } ⊆ R p×k (631)is convex. Vectors are compared with respect to the nonnegative orthant R M +while matrices are with respect to the positive semidefinite cone S M + .Convexity of the superlevel set corresponding to each and every S ∈ S M ,likewiseL S g = {X ∈ domg | g(X) ≽ S } ⊆ R p×k (644)is necessary and sufficient for quasiconcavity.△
3.9. SALIENT PROPERTIES 2713.8.0.0.3 Exercise. Nonconvexity of matrix product.Consider real function f on a positive definite domain[ ] [X1rel int SN+f(X) = tr(X 1 X 2 ) , X ∈ domf X 2 rel int S N +](645)with superlevel setsL s f = {X ∈ dom f | 〈X 1 , X 2 〉 ≥ s } (646)Prove: f(X) is not quasiconcave except when N = 1, nor is it quasiconvexunless X 1 = X 2 .3.8.1 bilinearBilinear function 3.27 x T y of vectors x and y is quasiconcave (monotonic) onthe entirety of the nonnegative orthants only when vectors are of dimension 1.3.8.2 quasilinearWhen a function is simultaneously quasiconvex and quasiconcave, it is calledquasilinear. Quasilinear functions are completely determined by convexlevel sets. One-dimensional function f(x) = x 3 and vector-valued signumfunction sgn(x) , for example, are quasilinear. Any monotonic function isquasilinear 3.28 (3.8.0.0.1,3.9 no.4, but not vice versa; Exercise 3.6.4.0.2).3.9 Salient propertiesof convex and quasiconvex functions1.A convex function is assumed continuous but not necessarilydifferentiable on the relative interior of its domain. [307,10]A quasiconvex function is not necessarily a continuous function.2. convex epigraph ⇔ convexity ⇒ quasiconvexity ⇔ convex sublevel sets.convex hypograph ⇔ concavity ⇒ quasiconcavity ⇔ convex superlevel.monotonicity ⇒ quasilinearity ⇔ convex level sets.3.27 Convex envelope of bilinear functions is well known. [3]3.28 e.g., a monotonic concave function is quasiconvex, but dare not confuse these terms.
- 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 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: 3.8. QUASICONVEX 269exponential alw
- 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
- Page 307 and 308: 4.3. RANK REDUCTION 3074.3.3.0.2 Ex
- Page 309 and 310: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 311 and 312: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 313 and 314: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 315 and 316: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 317 and 318: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 319 and 320: 4.4. RANK-CONSTRAINED SEMIDEFINITE
3.9. SALIENT PROPERTIES 2713.8.0.0.3 Exercise. Nonconvexity of matrix product.Consider real function f on a positive definite domain[ ] [X1rel int SN+f(X) = tr(X 1 X 2 ) , X ∈ domf X 2 rel int S N +](645)with superlevel setsL s f = {X ∈ dom f | 〈X 1 , X 2 〉 ≥ s } (646)Prove: f(X) is not quasiconcave except when N = 1, nor is it quasiconvexunless X 1 = X 2 .3.8.1 bilinearBilinear function 3.27 x T y of vectors x and y is quasiconcave (monotonic) onthe entirety of the nonnegative orthants only when vectors are of dimension 1.3.8.2 quasilinearWhen a function is simultaneously quasiconvex and quasiconcave, it is calledquasilinear. Quasilinear functions are completely determined by convexlevel sets. One-dimensional function f(x) = x 3 and vector-valued signumfunction sgn(x) , for example, are quasilinear. Any monotonic function isquasilinear 3.28 (3.8.0.0.1,3.9 no.4, but not vice versa; Exercise 3.6.4.0.2).3.9 Salient propertiesof convex and quasiconvex functions1.A convex function is assumed continuous but not necessarilydifferentiable on the relative interior of its domain. [307,10]A quasiconvex function is not necessarily a continuous function.2. convex epigraph ⇔ convexity ⇒ quasiconvexity ⇔ convex sublevel sets.convex hypograph ⇔ concavity ⇒ quasiconcavity ⇔ convex superlevel.monotonicity ⇒ quasilinearity ⇔ convex level sets.3.27 <strong>Convex</strong> envelope of bilinear functions is well known. [3]3.28 e.g., a monotonic concave function is quasiconvex, but dare not confuse these terms.