v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
242 CHAPTER 3. GEOMETRY OF CONVEX FUNCTIONS 3.3.2 quasilinear When a function is simultaneously quasiconvex and quasiconcave, it is called quasilinear. Quasilinear functions are completely determined by convex level sets. One-dimensional function f(x) = x 3 and vector-valued signum function sgn(x) , for example, are quasilinear. Any monotonic function is quasilinear 3.21 (but not vice versa, Exercise 3.1.11.0.1). 3.4 Salient properties of convex and quasiconvex functions 1. Aconvex (or concave) function is assumed continuous but not necessarily differentiable on the relative interior of its domain. [266,10] A quasiconvex (or quasiconcave) 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. 4. log-convex ⇒ convex ⇒ quasiconvex. concave ⇒ quasiconcave ⇐ log-concave ⇐ positive concave. 3.22 (homogeneity) Convexity, concavity, quasiconvexity, and quasiconcavity are invariant to nonnegative scaling of function. g convex ⇔ −g concave g quasiconvex ⇔ −g quasiconcave g log-convex ⇔ 1/g log-concave 5. The line theorem (3.2.3.0.1) translates identically to quasiconvexity (quasiconcavity). [53,3.4.2] 3.21 e.g., a monotonic concave function is quasiconvex, but dare not confuse these terms. 3.22 Log-convex means: logarithm of function f is convex on dom f .
3.4. SALIENT PROPERTIES 243 6. (affine transformation of argument) Composition g(h(X)) of a convex (concave) function g with any affine function h : R m×n → R p×k remains convex (concave) in X ∈ R m×n , where h(R m×n ) ∩ dom g ≠ ∅ . [173,B.2.1] Likewise for the quasiconvex (quasiconcave) functions g . 7. – Any nonnegatively weighted sum of convex (concave) functions remains convex (concave). (3.1.1.0.1) – Any nonnegatively weighted nonzero sum of strictly convex (concave) functions remains strictly convex (concave). – Pointwise supremum (infimum) of convex (concave) functions remains convex (concave). (Figure 64) [266,5] – Any nonnegatively weighted maximum (minimum) of quasiconvex (quasiconcave) functions remains quasiconvex (quasiconcave). – Pointwise supremum (infimum) of quasiconvex (quasiconcave) functions remains quasiconvex (quasiconcave).
- Page 191 and 192: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 193 and 194: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 195 and 196: Chapter 3 Geometry of convex functi
- Page 197 and 198: 3.1. CONVEX FUNCTION 197 f 1 (x) f
- Page 199 and 200: 3.1. CONVEX FUNCTION 199 3.1.3 norm
- Page 201 and 202: 3.1. CONVEX FUNCTION 201 A B 1 Figu
- Page 203 and 204: 3.1. CONVEX FUNCTION 203 k/m 1 0.9
- Page 205 and 206: k∑ i=1 3.1. CONVEX FUNCTION 205 S
- Page 207 and 208: 3.1. CONVEX FUNCTION 207 rather x >
- Page 209 and 210: 3.1. CONVEX FUNCTION 209 rather ] x
- Page 211 and 212: 3.1. CONVEX FUNCTION 211 3.1.6.0.2
- Page 213 and 214: 3.1. CONVEX FUNCTION 213 q(x) f(x)
- Page 215 and 216: 3.1. CONVEX FUNCTION 215 3.1.7.0.2
- Page 217 and 218: 3.1. CONVEX FUNCTION 217 We learned
- Page 219 and 220: 3.1. CONVEX FUNCTION 219 Since opti
- Page 221 and 222: 3.1. CONVEX FUNCTION 221 2 1.5 1 0.
- Page 223 and 224: 3.1. CONVEX FUNCTION 223 Setting th
- Page 225 and 226: 3.1. CONVEX FUNCTION 225 Similarly,
- Page 227 and 228: 3.1. CONVEX FUNCTION 227 For vector
- Page 229 and 230: 3.1. CONVEX FUNCTION 229 This means
- Page 231 and 232: 3.1. CONVEX FUNCTION 231 f(Y ) −
- Page 233 and 234: 3.2. MATRIX-VALUED CONVEX FUNCTION
- Page 235 and 236: 3.2. MATRIX-VALUED CONVEX FUNCTION
- Page 237 and 238: 3.2. MATRIX-VALUED CONVEX FUNCTION
- Page 239 and 240: 3.3. QUASICONVEX 239 exponential al
- Page 241: 3.3. QUASICONVEX 241 Unlike convex
- Page 245 and 246: Chapter 4 Semidefinite programming
- Page 247 and 248: 4.1. CONIC PROBLEM 247 where K is a
- Page 249 and 250: 4.1. CONIC PROBLEM 249 4.1.1.2 Redu
- Page 251 and 252: 4.1. CONIC PROBLEM 251 In any SDP f
- Page 253 and 254: 4.1. CONIC PROBLEM 253 Proposition
- Page 255 and 256: 4.2. FRAMEWORK 255 sets are closed
- Page 257 and 258: 4.2. FRAMEWORK 257 4.2.1.1.3 Exampl
- Page 259 and 260: 4.2. FRAMEWORK 259 4.2.2 Duals The
- Page 261 and 262: 4.2. FRAMEWORK 261 When equality is
- Page 263 and 264: 4.2. FRAMEWORK 263 The pseudoinvers
- Page 265 and 266: 4.2. FRAMEWORK 265 For the data giv
- Page 267 and 268: 4.2. FRAMEWORK 267 minimizes an aff
- Page 269 and 270: 4.3. RANK REDUCTION 269 whose rank
- Page 271 and 272: 4.3. RANK REDUCTION 271 and where m
- Page 273 and 274: 4.3. RANK REDUCTION 273 4.3.3 Optim
- Page 275 and 276: 4.3. RANK REDUCTION 275 Initialize:
- Page 277 and 278: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 279 and 280: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 281 and 282: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 283 and 284: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 285 and 286: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 287 and 288: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 289 and 290: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 291 and 292: 4.4. RANK-CONSTRAINED SEMIDEFINITE
242 CHAPTER 3. GEOMETRY OF CONVEX FUNCTIONS<br />
3.3.2 quasilinear<br />
When a function is simultaneously quasiconvex and quasiconcave, it is called<br />
quasilinear. Quasilinear functions are completely determined by convex<br />
level sets. One-dimensional function f(x) = x 3 and vector-valued signum<br />
function sgn(x) , for example, are quasilinear. Any monotonic function is<br />
quasilinear 3.21 (but not vice versa, Exercise 3.1.11.0.1).<br />
3.4 Salient properties<br />
of convex and quasiconvex functions<br />
1.<br />
Aconvex (or concave) function is assumed continuous but not<br />
necessarily differentiable on the relative interior of its domain.<br />
[266,10]<br />
A quasiconvex (or quasiconcave) function is not necessarily a<br />
continuous function.<br />
2. convex epigraph ⇔ convexity ⇒ quasiconvexity ⇔ convex sublevel sets.<br />
convex hypograph ⇔ concavity ⇒ quasiconcavity ⇔ convex superlevel.<br />
monotonicity ⇒ quasilinearity ⇔ convex level sets.<br />
3.<br />
4.<br />
log-convex ⇒ convex ⇒ quasiconvex.<br />
concave ⇒ quasiconcave ⇐ log-concave ⇐ positive concave. 3.22<br />
(homogeneity) <strong>Convex</strong>ity, concavity, quasiconvexity, and<br />
quasiconcavity are invariant to nonnegative scaling of function.<br />
g convex ⇔ −g concave<br />
g quasiconvex ⇔ −g quasiconcave<br />
g log-convex ⇔ 1/g log-concave<br />
5. The line theorem (3.2.3.0.1) translates identically to quasiconvexity<br />
(quasiconcavity). [53,3.4.2]<br />
3.21 e.g., a monotonic concave function is quasiconvex, but dare not confuse these terms.<br />
3.22 Log-convex means: logarithm of function f is convex on dom f .