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.

402 CHAPTER 5. EUCLIDEAN DISTANCE MATRIX<br />

5.8.2.1.1 Shore. The columns of Ξ r V N Ξ c hold a basis for N(1 T )<br />

when Ξ r and Ξ c are permutation matrices. In other words, any permutation<br />

of the rows or columns of V N leaves its range and nullspace unchanged;<br />

id est, R(Ξ r V N Ξ c )= R(V N )= N(1 T ) (805). Hence, two distinct matrix<br />

inequalities can be equivalent tests of the positive semidefiniteness of D on<br />

R(V N ) ; id est, −VN TDV N ≽ 0 ⇔ −(Ξ r V N Ξ c ) T D(Ξ r V N Ξ c )≽0. By properly<br />

choosing permutation matrices, 5.36 the leading principal submatrix T Ξ ∈ S 2<br />

of −(Ξ r V N Ξ c ) T D(Ξ r V N Ξ c ) may be loaded with the entries of D needed to<br />

test any particular triangle inequality (similarly to (958)-(966)). Because all<br />

the triangle inequalities can be individually tested using a test equivalent to<br />

the lone matrix inequality −VN TDV N ≽0, it logically follows that the lone<br />

matrix inequality tests all those triangle inequalities simultaneously. We<br />

conclude that −VN TDV N ≽0 is a sufficient test for the fourth property of the<br />

Euclidean metric, triangle inequality.<br />

<br />

5.8.2.2 Strict triangle inequality<br />

Without exception, all the inequalities in (966) and (967) can be made<br />

strict while their corresponding implications remain true. The then<br />

strict inequality (966a) or (967) may be interpreted as a strict triangle<br />

inequality under which collinear arrangement of points is not allowed.<br />

[194,24/6, p.322] Hence by similar reasoning, −VN TDV N ≻ 0 is a sufficient<br />

test of all the strict triangle inequalities; id est,<br />

δ(D) = 0<br />

D T = D<br />

−V T N DV N ≻ 0<br />

⎫<br />

⎬<br />

⎭ ⇒ √ d ij < √ d ik + √ d kj , i≠j ≠k (969)<br />

5.8.3 −V T N DV N nesting<br />

From (963) observe that T =−VN TDV N | N←3 . In fact, for D ∈ EDM N , the<br />

leading principal submatrices of −VN TDV N form a nested sequence (by<br />

inclusion) whose members are individually positive semidefinite [134] [176]<br />

[287] and have the same form as T ; videlicet, 5.37<br />

5.36 To individually test triangle inequality | √ d ik − √ d kj | ≤ √ d ij ≤ √ d ik + √ d kj for<br />

particular i,k,j, set Ξ r (i,1)= Ξ r (k,2)= Ξ r (j,3)=1 and Ξ c = I .<br />

5.37 −V DV | N←1 = 0 ∈ S 0 + (B.4.1)

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

Saved successfully!

Ooh no, something went wrong!