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.

B.4. AUXILIARY V -MATRICES 587<br />

the nullspace N(V )= R(1) is spanned by the eigenvector 1. The remaining<br />

eigenvectors span R(V ) ≡ 1 ⊥ = N(1 T ) that has dimension N −1.<br />

Because<br />

V 2 = V (1532)<br />

and V T = V , elementary matrix V is also a projection matrix (E.3)<br />

projecting orthogonally on its range N(1 T ) which is a hyperplane containing<br />

the origin in R N V = I − 1(1 T 1) −1 1 T (1533)<br />

The {0, 1} eigenvalues also indicate diagonalizable V is a projection<br />

matrix. [344,4.1, thm.4.1] Symmetry of V denotes orthogonal projection;<br />

from (1791),<br />

V T = V , V † = V , ‖V ‖ 2 = 1, V ≽ 0 (1534)<br />

Matrix V is also circulant [142].<br />

B.4.1.0.1 Example. Relationship of auxiliary to Householder matrix.<br />

Let H ∈ S N be a Householder matrix (1527) defined by<br />

⎡ ⎤<br />

u = ⎢<br />

1.<br />

⎥<br />

⎣ 1<br />

1 + √ ⎦ ∈ RN (1535)<br />

N<br />

Then we have [130,2]<br />

Let D ∈ S N h and define<br />

[ I 0<br />

V = H<br />

0 T 0<br />

[<br />

−HDH = ∆ A b<br />

−<br />

b T c<br />

]<br />

H (1536)<br />

]<br />

(1537)<br />

where b is a vector. Then because H is nonsingular (A.3.1.0.5) [158,3]<br />

[ ] A 0<br />

−V DV = −H<br />

0 T H ≽ 0 ⇔ −A ≽ 0 (1538)<br />

0<br />

and affine dimension is r = rankA when D is a Euclidean distance matrix.

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

Saved successfully!

Ooh no, something went wrong!