Chapter 3 Geometry of convex functions - Meboo Publishing ...

Chapter 3 Geometry of convex functions - Meboo Publishing ... Chapter 3 Geometry of convex functions - Meboo Publishing ...

convexoptimization.com
from convexoptimization.com More from this publisher
10.03.2015 Views

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.

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.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!