v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
488 CHAPTER 6. CONE OF DISTANCE MATRICES 6.8.1.6 EDM cone duality In5.6.1.1, via Gram-form EDM operator D(G) = δ(G)1 T + 1δ(G) T − 2G ∈ EDM N ⇐ G ≽ 0 (810) we established clear connection between the EDM cone and that face (1146) of positive semidefinite cone S N + in the geometric center subspace: EDM N = D(S N c ∩ S N +) (912) V(EDM N ) = S N c ∩ S N + (913) where In5.6.1 we established V(D) = −V DV 1 2 (901) S N c ∩ S N + = V N S N−1 + V T N (899) Then from (1179), (1187), and (1153) we can deduce δ(EDM N∗ 1) − EDM N∗ = V N S N−1 + V T N = S N c ∩ S N + (1192) which, by (912) and (913), means the EDM cone can be related to the dual EDM cone by an equality: ( EDM N = D δ(EDM N∗ 1) − EDM N∗) (1193) V(EDM N ) = δ(EDM N∗ 1) − EDM N∗ (1194) This means projection −V(EDM N ) of the EDM cone on the geometric center subspace S N c (E.7.2.0.2) is a linear transformation of the dual EDM cone: EDM N∗ − δ(EDM N∗ 1). Secondarily, it means the EDM cone is not self-dual.
6.8. DUAL EDM CONE 489 6.8.1.7 Schoenberg criterion is discretized membership relation We show the Schoenberg criterion −VN TDV } N ∈ S N−1 + D ∈ S N h ⇔ D ∈ EDM N (817) to be a discretized membership relation (2.13.4) between a closed convex cone K and its dual K ∗ like 〈y , x〉 ≥ 0 for all y ∈ G(K ∗ ) ⇔ x ∈ K (329) where G(K ∗ ) is any set of generators whose conic hull constructs closed convex dual cone K ∗ : The Schoenberg criterion is the same as } 〈zz T , −D〉 ≥ 0 ∀zz T | 11 T zz T = 0 ⇔ D ∈ EDM N (1140) D ∈ S N h which, by (1141), is the same as 〈zz T , −D〉 ≥ 0 ∀zz T ∈ { V N υυ T VN T | υ ∈ RN−1} D ∈ S N h } ⇔ D ∈ EDM N (1195) where the zz T constitute a set of generators G for the positive semidefinite cone’s smallest face F ( S N + ∋V ) (6.7.1) that contains auxiliary matrix V . From the aggregate in (1153) we get the ordinary membership relation, assuming only D ∈ S N [173, p.58] 〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ EDM N∗ ⇔ D ∈ EDM N (1196) 〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ {δ(u) | u∈ R N } − cone { V N υυ T V T N | υ ∈ RN−1} ⇔ D ∈ EDM N Discretization (329) yields: 〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ {e i e T i , −e j e T j , −V N υυ T V T N | i, j =1... N , υ ∈ R N−1 } ⇔ D ∈ EDM N (1197)
- Page 437 and 438: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 439 and 440: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 441 and 442: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 443 and 444: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 445 and 446: Chapter 6 Cone of distance matrices
- Page 447 and 448: 6.1. DEFINING EDM CONE 447 6.1 Defi
- Page 449 and 450: 6.2. POLYHEDRAL BOUNDS 449 This con
- Page 451 and 452: 6.3. √ EDM CONE IS NOT CONVEX 451
- Page 453 and 454: 6.4. A GEOMETRY OF COMPLETION 453 (
- Page 455 and 456: 6.4. A GEOMETRY OF COMPLETION 455 (
- Page 457 and 458: 6.4. A GEOMETRY OF COMPLETION 457 F
- Page 459 and 460: 6.5. EDM DEFINITION IN 11 T 459 by
- Page 461 and 462: 6.5. EDM DEFINITION IN 11 T 461 6.5
- Page 463 and 464: 6.5. EDM DEFINITION IN 11 T 463 1 0
- Page 465 and 466: 6.5. EDM DEFINITION IN 11 T 465 6.5
- Page 467 and 468: 6.6. CORRESPONDENCE TO PSD CONE S N
- Page 469 and 470: 6.6. CORRESPONDENCE TO PSD CONE S N
- Page 471 and 472: 6.6. CORRESPONDENCE TO PSD CONE S N
- Page 473 and 474: 6.7. VECTORIZATION & PROJECTION INT
- Page 475 and 476: 6.7. VECTORIZATION & PROJECTION INT
- Page 477 and 478: 6.8. DUAL EDM CONE 477 When the Fin
- Page 479 and 480: 6.8. DUAL EDM CONE 479 Proof. First
- Page 481 and 482: 6.8. DUAL EDM CONE 481 EDM 2 = S 2
- Page 483 and 484: 6.8. DUAL EDM CONE 483 whose veraci
- Page 485 and 486: 6.8. DUAL EDM CONE 485 6.8.1.3.1 Ex
- Page 487: 6.8. DUAL EDM CONE 487 has dual aff
- Page 491 and 492: 6.9. THEOREM OF THE ALTERNATIVE 491
- Page 493 and 494: 6.10. POSTSCRIPT 493 When D is an E
- Page 495 and 496: Chapter 7 Proximity problems In sum
- Page 497 and 498: 497 project on the subspace, then p
- Page 499 and 500: 499 H S N h 0 EDM N K = S N h ∩ R
- Page 501 and 502: 501 7.0.3 Problem approach Problems
- Page 503 and 504: 7.1. FIRST PREVALENT PROBLEM: 503 f
- Page 505 and 506: 7.1. FIRST PREVALENT PROBLEM: 505 7
- Page 507 and 508: 7.1. FIRST PREVALENT PROBLEM: 507 d
- Page 509 and 510: 7.1. FIRST PREVALENT PROBLEM: 509 7
- Page 511 and 512: 7.1. FIRST PREVALENT PROBLEM: 511 w
- Page 513 and 514: 7.1. FIRST PREVALENT PROBLEM: 513 T
- Page 515 and 516: 7.2. SECOND PREVALENT PROBLEM: 515
- Page 517 and 518: 7.2. SECOND PREVALENT PROBLEM: 517
- Page 519 and 520: 7.2. SECOND PREVALENT PROBLEM: 519
- Page 521 and 522: 7.2. SECOND PREVALENT PROBLEM: 521
- Page 523 and 524: 7.2. SECOND PREVALENT PROBLEM: 523
- Page 525 and 526: 7.3. THIRD PREVALENT PROBLEM: 525 g
- Page 527 and 528: 7.3. THIRD PREVALENT PROBLEM: 527 w
- Page 529 and 530: 7.3. THIRD PREVALENT PROBLEM: 529 7
- Page 531 and 532: 7.3. THIRD PREVALENT PROBLEM: 531 7
- Page 533 and 534: 7.3. THIRD PREVALENT PROBLEM: 533 O
- Page 535 and 536: 7.4. CONCLUSION 535 The rank constr
- Page 537 and 538: Appendix A Linear algebra A.1 Main-
6.8. DUAL EDM CONE 489<br />
6.8.1.7 Schoenberg criterion is discretized membership relation<br />
We show the Schoenberg criterion<br />
−VN TDV }<br />
N ∈ S N−1<br />
+<br />
D ∈ S N h<br />
⇔ D ∈ EDM N (817)<br />
to be a discretized membership relation (2.13.4) between a closed convex<br />
cone K and its dual K ∗ like<br />
〈y , x〉 ≥ 0 for all y ∈ G(K ∗ ) ⇔ x ∈ K (329)<br />
where G(K ∗ ) is any set of generators whose conic hull constructs closed<br />
convex dual cone K ∗ :<br />
The Schoenberg criterion is the same as<br />
}<br />
〈zz T , −D〉 ≥ 0 ∀zz T | 11 T zz T = 0<br />
⇔ D ∈ EDM N (1140)<br />
D ∈ S N h<br />
which, by (1141), is the same as<br />
〈zz T , −D〉 ≥ 0 ∀zz T ∈ { V N υυ T VN T | υ ∈ RN−1}<br />
D ∈ S N h<br />
}<br />
⇔ D ∈ EDM N (1195)<br />
where the zz T constitute a set of generators G for the positive semidefinite<br />
cone’s smallest face F ( S N + ∋V ) (6.7.1) that contains auxiliary matrix V .<br />
From the aggregate in (1153) we get the ordinary membership relation,<br />
assuming only D ∈ S N [173, p.58]<br />
〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ EDM N∗ ⇔ D ∈ EDM N<br />
(1196)<br />
〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ {δ(u) | u∈ R N } − cone { V N υυ T V T N | υ ∈ RN−1} ⇔ D ∈ EDM N<br />
Discretization (329) yields:<br />
〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ {e i e T i , −e j e T j , −V N υυ T V T N | i, j =1... N , υ ∈ R N−1 } ⇔ D ∈ EDM N<br />
(1197)