Chapter 3 Geometry of convex functions - Meboo Publishing ...
Chapter 3 Geometry of convex functions - Meboo Publishing ... Chapter 3 Geometry of convex functions - Meboo Publishing ...
250 CHAPTER 3. GEOMETRY OF CONVEX FUNCTIONS α β α ≥ β ≥ γ ∇f(X) Y−X γ {Z | f(Z) = α} {Y | ∇f(X) T (Y − X) = 0, f(X)=α} (590) Figure 76:(confer Figure 65) Shown is a plausible contour plot in R 2 of some arbitrary real differentiable convex function f(Z) at selected levels α , β , and γ ; contours of equal level f (level sets) drawn in the function’s domain. A convex function has convex sublevel sets L f(X) f (591). [301,4.6] The sublevel set whose boundary is the level set at α , for instance, comprises all the shaded regions. For any particular convex function, the family comprising all its sublevel sets is nested. [195, p.75] Were sublevel sets not convex, we may certainly conclude the corresponding function is neither convex. Contour plots of real affine functions are illustrated in Figure 26 and Figure 71.
3.7. GRADIENT 251 meaning, the gradient at X identifies a supporting hyperplane there in R p {Y ∈ R p | ∇f(X) T (Y − X) = 0} (590) to the convex sublevel sets of convex function f (confer (537)) L f(X) f {Z ∈ domf | f(Z) ≤ f(X)} ⊆ R p (591) illustrated for an arbitrary real convex function in Figure 76 and Figure 65. That supporting hyperplane is unique for twice differentiable f . [214, p.501] 3.7.3 first-order convexity condition, vector function Now consider the first-order necessary and sufficient condition for convexity of a vector-valued function: Differentiable function f(X) : R p×k →R M is convex if and only if domf is open, convex, and for each and every X,Y ∈ domf f(Y ) ≽ R M + f(X) + →Y −X df(X) = f(X) + d dt∣ f(X+ t (Y − X)) (592) t=0 →Y −X where df(X) is the directional derivative 3.19 [214] [326] of f at X in direction Y −X . This, of course, follows from the real-valued function case: by dual generalized inequalities (2.13.2.0.1), f(Y ) − f(X) − where →Y −X df(X) ≽ R M + →Y −X df(X) = 0 ⇔ ⎡ ⎢ ⎣ 〈 〉 →Y −X f(Y ) − f(X) − df(X) , w ≥ 0 ∀w ≽ 0 R M∗ + (593) tr ( ∇f 1 (X) T (Y − X) ) ⎤ tr ( ∇f 2 (X) T (Y − X) ) ⎥ . tr ( ∇f M (X) T (Y − X) ) ⎦ ∈ RM (594) 3.19 We extend the traditional definition of directional derivative inD.1.4 so that direction may be indicated by a vector or a matrix, thereby broadening the scope of the Taylor series (D.1.7). The right-hand side of the inequality (592) is the first-order Taylor series expansion of f about X .
- 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 and 22: 3.5. AFFINE FUNCTION 231 3.5.0.0.2
- Page 23 and 24: 3.6. EPIGRAPH, SUBLEVEL SET 233 q(x
- 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: 3.7. GRADIENT 249 f(Y ) [ ∇f(X)
- 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
3.7. GRADIENT 251<br />
meaning, the gradient at X identifies a supporting hyperplane there in R p<br />
{Y ∈ R p | ∇f(X) T (Y − X) = 0} (590)<br />
to the <strong>convex</strong> sublevel sets <strong>of</strong> <strong>convex</strong> function f (confer (537))<br />
L f(X) f {Z ∈ domf | f(Z) ≤ f(X)} ⊆ R p (591)<br />
illustrated for an arbitrary real <strong>convex</strong> function in Figure 76 and Figure 65.<br />
That supporting hyperplane is unique for twice differentiable f . [214, p.501]<br />
3.7.3 first-order <strong>convex</strong>ity condition, vector function<br />
Now consider the first-order necessary and sufficient condition for <strong>convex</strong>ity <strong>of</strong><br />
a vector-valued function: Differentiable function f(X) : R p×k →R M is <strong>convex</strong><br />
if and only if domf is open, <strong>convex</strong>, and for each and every X,Y ∈ domf<br />
f(Y ) ≽<br />
R M +<br />
f(X) +<br />
→Y −X<br />
df(X)<br />
= f(X) + d dt∣ f(X+ t (Y − X)) (592)<br />
t=0<br />
→Y −X<br />
where df(X) is the directional derivative 3.19 [214] [326] <strong>of</strong> f at X in direction<br />
Y −X . This, <strong>of</strong> course, follows from the real-valued function case: by dual<br />
generalized inequalities (2.13.2.0.1),<br />
f(Y ) − f(X) −<br />
where<br />
→Y −X<br />
df(X) ≽<br />
R M +<br />
→Y −X<br />
df(X) =<br />
0 ⇔<br />
⎡<br />
⎢<br />
⎣<br />
〈<br />
〉<br />
→Y −X<br />
f(Y ) − f(X) − df(X) , w ≥ 0 ∀w ≽ 0<br />
R M∗<br />
+<br />
(593)<br />
tr ( ∇f 1 (X) T (Y − X) ) ⎤<br />
tr ( ∇f 2 (X) T (Y − X) )<br />
⎥<br />
.<br />
tr ( ∇f M (X) T (Y − X) ) ⎦ ∈ RM (594)<br />
3.19 We extend the traditional definition <strong>of</strong> directional derivative inD.1.4 so that direction<br />
may be indicated by a vector or a matrix, thereby broadening the scope <strong>of</strong> the Taylor<br />
series (D.1.7). The right-hand side <strong>of</strong> the inequality (592) is the first-order Taylor series<br />
expansion <strong>of</strong> f about X .