10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

46 CHAPTER 2. CONVEX GEOMETRY<br />

and where ◦ denotes the Hadamard product 2.10 of matrices [134,1.1.4]. The<br />

adjoint operation A T on a matrix can therefore be defined in like manner:<br />

〈Y , A T Z〉 ∆ = 〈AY , Z〉 (33)<br />

Take any element C 1 from a matrix-valued set in R p×k , for example, and<br />

consider any particular dimensionally compatible real vectors v and w .<br />

Then vector inner-product of C 1 with vw T is<br />

〈vw T , C 1 〉 = 〈v , C 1 w〉 = v T C 1 w = tr(wv T C 1 ) = 1 T( (vw T )◦ C 1<br />

)<br />

1 (34)<br />

Further, linear bijective vectorization is distributive with respect to<br />

Hadamard product; id est,<br />

vec(Y ◦ Z) = vec(Y ) ◦ vec(Z) (35)<br />

2.2.0.0.1 Example. Application of the image theorem.<br />

Suppose the set C ⊆ R p×k is convex. Then for any particular vectors v ∈R p<br />

and w ∈R k , the set of vector inner-products<br />

Y ∆ = v T Cw = 〈vw T , C〉 ⊆ R (36)<br />

is convex. This result is a consequence of the image theorem. Yet it is easy<br />

to show directly that convex combination of elements from Y remains an<br />

element of Y . 2.11<br />

<br />

More generally, vw T in (36) may be replaced with any particular matrix<br />

Z ∈ R p×k while convexity of the set 〈Z , C〉⊆ R persists. Further, by<br />

replacing v and w with any particular respective matrices U and W of<br />

dimension compatible with all elements of convex set C , then set U T CW<br />

is convex by the image theorem because it is a linear mapping of C .<br />

2.10 The Hadamard product is a simple entrywise product of corresponding entries from<br />

two matrices of like size; id est, not necessarily square. A commutative operation, the<br />

Hadamard product can be extracted from within a Kronecker product. [176, p.475]<br />

2.11 To verify that, take any two elements C 1 and C 2 from the convex matrix-valued set C ,<br />

and then form the vector inner-products (36) that are two elements of Y by definition.<br />

Now make a convex combination of those inner products; videlicet, for 0≤µ≤1<br />

µ 〈vw T , C 1 〉 + (1 − µ) 〈vw T , C 2 〉 = 〈vw T , µ C 1 + (1 − µ)C 2 〉<br />

The two sides are equivalent by linearity of inner product. The right-hand side remains<br />

a vector inner-product of vw T with an element µ C 1 + (1 − µ)C 2 from the convex set C ;<br />

hence, it belongs to Y . Since that holds true for any two elements from Y , then it must<br />

be a convex set.

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

Saved successfully!

Ooh no, something went wrong!