10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

590 APPENDIX B. SIMPLE MATRICES<br />

has R(V W )= N(1 T ) and orthonormal columns. [5] We defined three<br />

auxiliary V -matrices: V , V N (804), and V W sharing some attributes listed<br />

in Table B.4.4. For example, V can be expressed<br />

V = V W V T W = V N V † N<br />

(1541)<br />

but V T W V W<br />

= I means V is an orthogonal projector (1788) and<br />

V † W = V T W , ‖V W ‖ 2 = 1 , V T W1 = 0 (1542)<br />

B.4.4<br />

Auxiliary V -matrix Table<br />

dimV rankV R(V ) N(V T ) V T V V V T V V †<br />

V N ×N N −1 N(1 T ) R(1) V V V<br />

[ ]<br />

V N N ×(N −1) N −1 N(1 T 1<br />

) R(1) (I + 2 11T 1 N −1 −1<br />

T<br />

) V<br />

2 −1 I<br />

V W N ×(N −1) N −1 N(1 T ) R(1) I V V<br />

B.4.5<br />

More auxiliary matrices<br />

Mathar shows [223,2] that any elementary matrix (B.3) of the form<br />

V M = I − b1 T ∈ R N×N (1543)<br />

such that b T 1 = 1 (confer [136,2]), is an auxiliary V -matrix having<br />

R(V T M ) = N(bT ), R(V M ) = N(1 T )<br />

N(V M ) = R(b), N(V T M ) = R(1) (1544)<br />

Given X ∈ R n×N , the choice b= 1 N 1 (V M=V ) minimizes ‖X(I − b1 T )‖ F .<br />

[138,3.2.1]

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

Saved successfully!

Ooh no, something went wrong!