v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
10.03.2015 Views

418 CHAPTER 5. EUCLIDEAN DISTANCE MATRIX D ∈ EDM N ⇒ ⎧ λ(−D) i ≥ 0, i=1... N −1 ⎪⎨ ( N ) ∑ λ(−D) i = 0 i=1 ⎪⎩ D ∈ S N h ∩ R N×N + (1009) where the λ(−D) i are nonincreasingly ordered eigenvalues of −D whose sum must be 0 only because trD = 0 [287,5.1]. The eigenvalue summation condition, therefore, can be considered redundant. Even so, all these conditions are insufficient to determine whether some given H ∈ S N h is an EDM, as shown by counter-example. 5.47 5.11.1.0.1 Exercise. Spectral inequality. Prove whether it holds: for D=[d ij ]∈ EDM N λ(−D) 1 ≥ d ij ≥ λ(−D) N−1 ∀i ≠ j (1010) Terminology: a spectral cone is a convex cone containing all eigenspectra [197, p.365] [285, p.26] corresponding to some set of matrices. Any positive semidefinite matrix, for example, possesses a vector of nonnegative eigenvalues corresponding to an eigenspectrum contained in a spectral cone that is a nonnegative orthant. 5.11.2 Spectral cones [ 0 1 T Denoting the eigenvalues of Cayley-Menger matrix 1 −D ([ 0 1 T λ 1 −D 5.47 When N = 3, for example, the symmetric hollow matrix H = ⎡ ⎣ 0 1 1 1 0 5 1 5 0 ⎤ ] ∈ S N+1 by ]) ∈ R N+1 (1011) ⎦ ∈ S N h ∩ R N×N + is not an EDM, although λ(−H) = [5 0.3723 −5.3723] T conforms to (1009).

5.11. EDM INDEFINITENESS 419 we have the Cayley-Menger form (5.7.3.0.1) of necessary and sufficient conditions for D ∈ EDM N from the literature: [158,3] 5.48 [65,3] [96,6.2] (confer (817) (793)) D ∈ EDM N ⇔ ⎧ ⎪⎨ ⎪⎩ ([ 0 1 T λ 1 −D D ∈ S N h ]) ≥ 0 , i i = 1... N ⎫ ⎪⎬ ⎪⎭ ⇔ { −V T N DV N ≽ 0 D ∈ S N h (1012) These conditions say the Cayley-Menger form has ([ one and]) only one negative 0 1 T eigenvalue. When D is an EDM, eigenvalues λ belong to that 1 −D particular orthant in R N+1 having the N+1 th coordinate as sole negative coordinate 5.49 : [ ] R N + = cone {e R 1 , e 2 , · · · e N , −e N+1 } (1013) − 5.11.2.1 Cayley-Menger versus Schoenberg Connection to the Schoenberg criterion (817) is made when the Cayley-Menger form is further partitioned: [ 0 1 T 1 −D ⎡ [ ] [ ] ⎤ ] 0 1 1 T ⎢ = ⎣ 1 0 −D 1,2:N ⎥ ⎦ (1014) [1 −D 2:N,1 ] −D 2:N,2:N [ ] 0 1 Matrix D ∈ S N h is an EDM if and only if the Schur complement of 1 0 (A.4) in this partition is positive semidefinite; [16,1] [188,3] id est, 5.48 Recall: for D ∈ S N h , −V T N DV N ≽ 0 subsumes nonnegativity property 1 (5.8.1). 5.49 Empirically, all except one entry of the corresponding eigenvector have the same sign with respect to each other.

5.11. EDM INDEFINITENESS 419<br />

we have the Cayley-Menger form (5.7.3.0.1) of necessary and sufficient<br />

conditions for D ∈ EDM N from the literature: [158,3] 5.48 [65,3] [96,6.2]<br />

(confer (817) (793))<br />

D ∈ EDM N ⇔<br />

⎧<br />

⎪⎨<br />

⎪⎩<br />

([ 0 1<br />

T<br />

λ<br />

1 −D<br />

D ∈ S N h<br />

])<br />

≥ 0 ,<br />

i<br />

i = 1... N<br />

⎫<br />

⎪⎬<br />

⎪⎭ ⇔ {<br />

−V<br />

T<br />

N DV N ≽ 0<br />

D ∈ S N h<br />

(1012)<br />

These conditions say the Cayley-Menger form has ([ one and])<br />

only one negative<br />

0 1<br />

T<br />

eigenvalue. When D is an EDM, eigenvalues λ belong to that<br />

1 −D<br />

particular orthant in R N+1 having the N+1 th coordinate as sole negative<br />

coordinate 5.49 :<br />

[ ]<br />

R<br />

N<br />

+<br />

= cone {e<br />

R 1 , e 2 , · · · e N , −e N+1 } (1013)<br />

−<br />

5.11.2.1 Cayley-Menger versus Schoenberg<br />

Connection to the Schoenberg criterion (817) is made when the<br />

Cayley-Menger form is further partitioned:<br />

[ 0 1<br />

T<br />

1 −D<br />

⎡ [ ] [ ] ⎤<br />

] 0 1 1 T<br />

⎢<br />

= ⎣ 1 0 −D 1,2:N<br />

⎥<br />

⎦ (1014)<br />

[1 −D 2:N,1 ] −D 2:N,2:N<br />

[ ] 0 1<br />

Matrix D ∈ S N h is an EDM if and only if the Schur complement of<br />

1 0<br />

(A.4) in this partition is positive semidefinite; [16,1] [188,3] id est,<br />

5.48 Recall: for D ∈ S N h , −V T N DV N ≽ 0 subsumes nonnegativity property 1 (5.8.1).<br />

5.49 Empirically, all except one entry of the corresponding eigenvector have the same sign<br />

with respect to each other.

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

Saved successfully!

Ooh no, something went wrong!