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.

490 CHAPTER 6. CONE OF DISTANCE MATRICES<br />

Because 〈 {δ(u) | u∈ R N }, D 〉 ≥ 0 ⇔ D ∈ S N h , we can restrict observation<br />

to the symmetric hollow subspace without loss of generality. Then for D ∈ S N h<br />

〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ { −V N υυ T V T N | υ ∈ R N−1} ⇔ D ∈ EDM N (1198)<br />

this discretized membership relation becomes (1195); identical to the<br />

Schoenberg criterion.<br />

Hitherto a correspondence between the EDM cone and a face of a PSD<br />

cone, the Schoenberg criterion is now accurately interpreted as a discretized<br />

membership relation between the EDM cone and its ordinary dual.<br />

6.8.2 Ambient S N h<br />

When instead we consider the ambient space of symmetric hollow matrices<br />

(1154), then still we find the EDM cone is not self-dual for N >2. The<br />

simplest way to prove this is as follows:<br />

Given a set of generators G = {Γ} (1117) for the pointed closed convex<br />

EDM cone, the discretized membership theorem in2.13.4.2.1 asserts that<br />

members of the dual EDM cone in the ambient space of symmetric hollow<br />

matrices can be discerned via discretized membership relation:<br />

EDM N∗ ∩ S N h<br />

∆<br />

= {D ∗ ∈ S N h | 〈Γ , D ∗ 〉 ≥ 0 ∀ Γ ∈ G(EDM N )}<br />

(1199)<br />

By comparison<br />

= {D ∗ ∈ S N h | 〈δ(zz T )1 T + 1δ(zz T ) T − 2zz T , D ∗ 〉 ≥ 0 ∀z∈ N(1 T )}<br />

= {D ∗ ∈ S N h | 〈1δ(zz T ) T − zz T , D ∗ 〉 ≥ 0 ∀z∈ N(1 T )}<br />

EDM N = {D ∈ S N h | 〈−zz T , D〉 ≥ 0 ∀z∈ N(1 T )} (1200)<br />

the term δ(zz T ) T D ∗ 1 foils any hope of self-duality in ambient S N h .

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

Saved successfully!

Ooh no, something went wrong!