Chapter 3 Geometry of convex functions - Meboo Publishing ...
Chapter 3 Geometry of convex functions - Meboo Publishing ...
Chapter 3 Geometry of convex functions - Meboo Publishing ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
3.9. QUASICONVEX 261<br />
3.9.0.0.2 Definition. Quasi<strong>convex</strong> multidimensional function.<br />
Scalar-, vector-, or matrix-valued function g(X) : R p×k →S M is a quasi<strong>convex</strong><br />
function <strong>of</strong> matrix X iff domg is a <strong>convex</strong> set and the sublevel set<br />
corresponding to each and every S ∈ S M<br />
L S<br />
g = {X ∈ dom g | g(X) ≼ S } ⊆ R p×k (607)<br />
is <strong>convex</strong>. Vectors are compared with respect to the nonnegative orthant R M +<br />
while matrices are with respect to the positive semidefinite cone S M + .<br />
Convexity <strong>of</strong> the superlevel set corresponding to each and every S ∈ S M ,<br />
likewise<br />
L S g = {X ∈ domg | g(X) ≽ S } ⊆ R p×k (620)<br />
is necessary and sufficient for quasiconcavity.<br />
3.9.0.0.3 Exercise. Non<strong>convex</strong>ity <strong>of</strong> matrix product.<br />
Consider real function f on a positive definite domain<br />
[ ] [<br />
X1<br />
rel int S<br />
N<br />
+<br />
f(X) = tr(X 1 X 2 ) , X ∈ domf <br />
X 2 rel int S N +<br />
with superlevel sets<br />
]<br />
△<br />
(621)<br />
L s f = {X ∈ dom f | 〈X 1 , X 2 〉 ≥ s } (622)<br />
Prove: f(X) is not quasiconcave except when N = 1, nor is it quasi<strong>convex</strong><br />
unless X 1 = X 2 .<br />
<br />
3.9.1 bilinear<br />
Bilinear function 3.24 x T y <strong>of</strong> vectors x and y is quasiconcave (monotonic) on<br />
the entirety <strong>of</strong> the nonnegative orthants only when vectors are <strong>of</strong> dimension 1.<br />
3.9.2 quasilinear<br />
When a function is simultaneously quasi<strong>convex</strong> and quasiconcave, it is called<br />
quasilinear. Quasilinear <strong>functions</strong> are completely determined by <strong>convex</strong><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.25 (but not vice versa, Exercise 3.7.4.0.1).<br />
3.24 Convex envelope <strong>of</strong> bilinear <strong>functions</strong> is well known. [3]<br />
3.25 e.g., a monotonic concave function is quasi<strong>convex</strong>, but dare not confuse these terms.