13.07.2015 Views

v2006.03.09 - Convex Optimization

v2006.03.09 - Convex Optimization

v2006.03.09 - 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.

5.8. DUAL EDM CONE 3435.8.1.3 Dual Euclidean distance matrix criterionConditions necessary for membership of a matrix D ∗ ∈ S N to thedual EDM cone EDM N∗ may be derived from (790): D ∗ ∈ EDM N∗ ⇒D ∗ = δ(y) − V N AVNT for some vector y and positive semidefinite matrixA∈ S N−1+ . This in turn implies δ(D ∗ 1)=δ(y) . Then, for D ∗ ∈ S Nwhere, for any symmetric matrix D ∗D ∗ ∈ EDM N∗ ⇔ δ(D ∗ 1) − D ∗ ≽ 0 (816)δ(D ∗ 1) − D ∗ ∈ S N c (817)To show sufficiency of the matrix criterion in (816), recall Gram-formEDM operatorD(G) = δ(G)1 T + 1δ(G) T − 2G (472)where Gram matrix G is positive semidefinite by definition, and recall theself-adjointness property of the main-diagonal linear operator δ (A.1):〈D , D ∗ 〉 = 〈 δ(G)1 T + 1δ(G) T − 2G , D ∗〉 = 〈G , δ(D ∗ 1) − D ∗ 〉 2 (491)Assuming 〈G , δ(D ∗ 1) − D ∗ 〉≥ 0 (1082), then we have known membershiprelation (2.13.2.0.1)D ∗ ∈ EDM N∗ ⇔ 〈D , D ∗ 〉 ≥ 0 ∀D ∈ EDM N (818)Elegance of this matrix criterion (816) for membership to the dualEDM cone is the lack of any other assumptions except D ∗ be symmetric.(Recall: Schoenberg criterion (479) for membership to the EDM cone requiresmembership to the symmetric hollow subspace.)Linear Gram-form EDM operator has adjoint, for Y ∈ S NThen we have: [50, p.111]D T (Y ) ∆ = (δ(Y 1) − Y ) 2 (819)EDM N∗ = {Y ∈ S N | δ(Y 1) − Y ≽ 0} (820)the dual EDM cone expressed in terms of the adjoint operator. A dual EDMcone determined this way is illustrated in Figure 87.We leave it an exercise to find a spectral cone as in4.11.2 correspondingto EDM N∗ .

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

Saved successfully!

Ooh no, something went wrong!