Chapter 3 Geometry of convex functions - Meboo Publishing ...
Chapter 3 Geometry of convex functions - Meboo Publishing ... Chapter 3 Geometry of convex functions - Meboo Publishing ...
232 CHAPTER 3. GEOMETRY OF CONVEX FUNCTIONS {a T z 1 + b 1 | a∈ R} supa T pz i + b i i {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 72: Pointwise supremum of convex functions remains convex; by epigraph intersection. Supremum of affine functions in variable a evaluated at argument a p is illustrated. Topmost affine function per a is supremum. a positively homogeneous function of direction a whose range contains ±∞. [244, 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 72). Application of the support function is illustrated in Figure 29a for one particular normal a . Given nonempty closed bounded convex sets Y and Z in R n and nonnegative scalars β and γ [364, p.234] σ βY+γZ (a) = βσ Y (a) + γσ Z (a) (532) 3.5.0.0.4 Exercise. Level sets. Given a function f and constant κ , its level sets are defined L κ κf {z | f(z)=κ} (533) Give two distinct examples of convex function, that are not affine, having convex level sets.
3.6. EPIGRAPH, SUBLEVEL SET 233 q(x) f(x) quasiconvex convex x x Figure 73: Quasiconvex function q epigraph is not necessarily convex, but convex function f epigraph is convex in any dimension. Sublevel sets are necessarily convex for either function, but sufficient only for quasiconvexity. 3.6 Epigraph, Sublevel set It is well established that a continuous real function is convex if and only if its epigraph makes a convex set. [195] [301] [351] [364] [244] Thereby, piecewise-continuous convex functions are admitted. Epigraph is the connection between convex sets and convex functions. Its generalization to a vector-valued function f(X) : R p×k →R M is straightforward: [289] epi f {(X , t)∈ R p×k × R M | X ∈ domf , f(X) ≼ t } (534) R M + id est, f convex ⇔ epif convex (535) Necessity is proven: [59, exer.3.60] Given any (X, u), (Y , v)∈ epif , we must show for all µ∈[0, 1] that µ(X, u) + (1−µ)(Y , v)∈ epif ; id est, we must show f(µX + (1−µ)Y ) ≼ µu + (1−µ)v (536) R M + Yet this holds by definition because f(µX+(1−µ)Y ) ≼ µf(X)+(1−µ)f(Y ). The converse also holds.
- Page 1 and 2: Chapter 3 Geometry of convex functi
- Page 3 and 4: 3.1. CONVEX FUNCTION 213 f 1 (x) f
- Page 5 and 6: 3.1. CONVEX FUNCTION 215 Rf (b) f(X
- Page 7 and 8: 3.3. PRACTICAL NORM FUNCTIONS, ABSO
- Page 9 and 10: 3.3. PRACTICAL NORM FUNCTIONS, ABSO
- Page 11 and 12: 3.3. PRACTICAL NORM FUNCTIONS, ABSO
- Page 13 and 14: 3.3. PRACTICAL NORM FUNCTIONS, ABSO
- Page 15 and 16: 3.3. PRACTICAL NORM FUNCTIONS, ABSO
- Page 17 and 18: 3.4. INVERTED FUNCTIONS AND ROOTS 2
- Page 19 and 20: 3.5. AFFINE FUNCTION 229 3.4.1.3 po
- Page 21: 3.5. AFFINE FUNCTION 231 3.5.0.0.2
- Page 25 and 26: 3.6. EPIGRAPH, SUBLEVEL SET 235 To
- Page 27 and 28: 3.6. EPIGRAPH, SUBLEVEL SET 237 con
- Page 29 and 30: 3.6. EPIGRAPH, SUBLEVEL SET 239 3.6
- Page 31 and 32: 3.7. GRADIENT 241 2 1.5 1 0.5 Y 2 0
- Page 33 and 34: 3.7. GRADIENT 243 From (1749) andD.
- Page 35 and 36: 3.7. GRADIENT 245 This equivalence
- Page 37 and 38: 3.7. GRADIENT 247 3.7.1.0.3 Example
- Page 39 and 40: 3.7. GRADIENT 249 f(Y ) [ ∇f(X)
- Page 41 and 42: 3.7. GRADIENT 251 meaning, the grad
- Page 43 and 44: 3.8. MATRIX-VALUED CONVEX FUNCTION
- Page 45 and 46: 3.8. MATRIX-VALUED CONVEX FUNCTION
- Page 47 and 48: 3.8. MATRIX-VALUED CONVEX FUNCTION
- Page 49 and 50: 3.9. QUASICONVEX 259 3.8.3.0.6 Exam
- Page 51 and 52: 3.9. QUASICONVEX 261 3.9.0.0.2 Defi
- Page 53: 3.10. SALIENT PROPERTIES 263 7. - N
232 CHAPTER 3. GEOMETRY OF CONVEX FUNCTIONS<br />
{a T z 1 + b 1 | a∈ R}<br />
supa T pz i + b i<br />
i<br />
{a T z 2 + b 2 | a∈ R}<br />
{a T z 3 + b 3 | a∈ R}<br />
a<br />
{a T z 4 + b 4 | a∈ R}<br />
{a T z 5 + b 5 | a∈ R}<br />
Figure 72: Pointwise supremum <strong>of</strong> <strong>convex</strong> <strong>functions</strong> remains <strong>convex</strong>; by<br />
epigraph intersection. Supremum <strong>of</strong> affine <strong>functions</strong> in variable a evaluated<br />
at argument a p is illustrated. Topmost affine function per a is supremum.<br />
a positively homogeneous function <strong>of</strong> direction a whose range contains ±∞.<br />
[244, p.135] For each z ∈ Y , a T z is a linear function <strong>of</strong> vector a . Because<br />
σ Y (a) is a pointwise supremum <strong>of</strong> linear <strong>functions</strong>, it is <strong>convex</strong> in a<br />
(Figure 72). Application <strong>of</strong> the support function is illustrated in Figure 29a<br />
for one particular normal a . Given nonempty closed bounded <strong>convex</strong> sets Y<br />
and Z in R n and nonnegative scalars β and γ [364, p.234]<br />
σ βY+γZ (a) = βσ Y (a) + γσ Z (a) (532)<br />
<br />
3.5.0.0.4 Exercise. Level sets.<br />
Given a function f and constant κ , its level sets are defined<br />
L κ κf {z | f(z)=κ} (533)<br />
Give two distinct examples <strong>of</strong> <strong>convex</strong> function, that are not affine, having<br />
<strong>convex</strong> level sets.