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.

E.6. VECTORIZATION INTERPRETATION, 663<br />

E.6.2.1.1 Example. λ as coefficients of nonorthogonal projection.<br />

Any diagonalization (A.5)<br />

X = SΛS −1 =<br />

m∑<br />

λ i s i wi T ∈ R m×m (1438)<br />

i=1<br />

may be expressed as a sum of one-dimensional nonorthogonal projections<br />

of X , each on the range of a vectorized eigenmatrix P j ∆ = s j w T j ;<br />

∑<br />

X = m 〈(Se i e T jS −1 ) T , X〉 Se i e T jS −1<br />

i,j=1<br />

∑<br />

= m ∑<br />

〈(s j wj T ) T , X〉 s j wj T + m 〈(Se i e T jS −1 ) T , SΛS −1 〉 Se i e T jS −1<br />

j=1<br />

∑<br />

= m 〈(s j wj T ) T , X〉 s j wj<br />

T<br />

j=1<br />

i,j=1<br />

j ≠ i<br />

∆ ∑<br />

= m ∑<br />

〈Pj T , X〉 P j = m s j wj T Xs j wj<br />

T<br />

j=1<br />

∑<br />

= m λ j s j wj<br />

T<br />

j=1<br />

j=1<br />

∑<br />

= m P j XP j<br />

j=1<br />

(1845)<br />

This biorthogonal expansion of matrix X is a sum of nonorthogonal<br />

projections because the term outside the projection coefficient 〈 〉 is not<br />

identical to the inside-term. (E.6.4) The eigenvalues λ j are coefficients of<br />

nonorthogonal projection of X , while the remaining M(M −1)/2 coefficients<br />

(for i≠j) are zeroed by projection. When P j is rank-one as in (1845),<br />

R(vec P j XP j ) = R(vecs j w T j ) = R(vecP j ) in R m2 (1846)<br />

and<br />

P j XP j − X ⊥ P T j in R m2 (1847)<br />

Were matrix X symmetric, then its eigenmatrices would also be. So the<br />

one-dimensional projections would become orthogonal. (E.6.4.1.1)

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

Saved successfully!

Ooh no, something went wrong!