v2007.09.13 - Convex Optimization
v2007.09.13 - Convex Optimization v2007.09.13 - Convex Optimization
430 CHAPTER 6. EDM CONE6.8.1.6 EDM cone dualityIn5.6.1.1, via Gram-form EDM operatorD(G) = δ(G)1 T + 1δ(G) T − 2G ∈ EDM N ⇐ G ≽ 0 (717)we established clear connection between the EDM cone and that face (1043)of positive semidefinite cone S N + in the geometric center subspace:EDM N = D(S N c ∩ S N +) (812)V(EDM N ) = S N c ∩ S N + (813)whereIn5.6.1 we establishedV(D) = −V DV 1 2(801)S N c ∩ S N + = V N S N−1+ V T N (799)Then from (1076), (1084), and (1050) we can deduceδ(EDM N∗ 1) − EDM N∗ = V N S N−1+ V T N = S N c ∩ S N + (1089)which, by (812) and (813), means the EDM cone can be related to the dualEDM cone by an equality:(EDM N = D δ(EDM N∗ 1) − EDM N∗) (1090)V(EDM N ) = δ(EDM N∗ 1) − EDM N∗ (1091)This means projection −V(EDM N ) of the EDM cone on the geometriccenter subspace S N c (E.7.2.0.2) is an affine transformation of the dual EDMcone: EDM N∗ − δ(EDM N∗ 1). Secondarily, it means the EDM cone is notself-dual.
6.8. DUAL EDM CONE 4316.8.1.7 Schoenberg criterion is discretized membership relationWe show the Schoenberg criterion−VN TDV }N ∈ S N−1+D ∈ S N h⇔ D ∈ EDM N (724)to be a discretized membership relation (2.13.4) between a closed convexcone K and its dual K ∗ like〈y , x〉 ≥ 0 for all y ∈ G(K ∗ ) ⇔ x ∈ K (317)where G(K ∗ ) is any set of generators whose conic hull constructs closedconvex dual cone K ∗ :The Schoenberg criterion is the same as}〈zz T , −D〉 ≥ 0 ∀zz T | 11 T zz T = 0⇔ D ∈ EDM N (1037)D ∈ S N hwhich, by (1038), is the same as〈zz T , −D〉 ≥ 0 ∀zz T ∈ { V N υυ T VN T | υ ∈ RN−1}D ∈ S N h}⇔ D ∈ EDM N (1092)where the zz T constitute a set of generators G for the positive semidefinitecone’s smallest face F ( S N + ∋V ) (6.7.1) that contains auxiliary matrix V .From the aggregate in (1050) we get the ordinary membership relation,assuming only D ∈ S N [147, p.58],〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ EDM N∗ ⇔ D ∈ EDM N(1093)〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ {δ(u) | u∈ R N } − cone { V N υυ T V T N | υ ∈ RN−1} ⇔ D ∈ EDM NDiscretization yields (317):〈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(1094)
- Page 379 and 380: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 381 and 382: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 383 and 384: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 385 and 386: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 387 and 388: Chapter 6EDM coneFor N > 3, the con
- Page 389 and 390: 6.1. DEFINING EDM CONE 3896.1 Defin
- Page 391 and 392: 6.2. POLYHEDRAL BOUNDS 391This cone
- Page 393 and 394: 6.3.√EDM CONE IS NOT CONVEX 393N
- Page 395 and 396: 6.4. A GEOMETRY OF COMPLETION 3956.
- Page 397 and 398: 6.4. A GEOMETRY OF COMPLETION 397(a
- Page 399 and 400: 6.4. A GEOMETRY OF COMPLETION 399Fi
- Page 401 and 402: 6.5. EDM DEFINITION IN 11 T 401and
- Page 403 and 404: 6.5. EDM DEFINITION IN 11 T 403then
- Page 405 and 406: 6.5. EDM DEFINITION IN 11 T 4056.5.
- Page 407 and 408: 6.5. EDM DEFINITION IN 11 T 407D =
- Page 409 and 410: 6.6. CORRESPONDENCE TO PSD CONE S N
- Page 411 and 412: 6.6. CORRESPONDENCE TO PSD CONE S N
- Page 413 and 414: 6.6. CORRESPONDENCE TO PSD CONE S N
- Page 415 and 416: 6.7. VECTORIZATION & PROJECTION INT
- Page 417 and 418: 6.7. VECTORIZATION & PROJECTION INT
- Page 419 and 420: 6.8. DUAL EDM CONE 419When the Fins
- Page 421 and 422: 6.8. DUAL EDM CONE 421Proof. First,
- Page 423 and 424: 6.8. DUAL EDM CONE 423EDM 2 = S 2 h
- Page 425 and 426: 6.8. DUAL EDM CONE 425whose veracit
- Page 427 and 428: 6.8. DUAL EDM CONE 4276.8.1.3.1 Exe
- Page 429: 6.8. DUAL EDM CONE 429has dual affi
- Page 433 and 434: 6.9. THEOREM OF THE ALTERNATIVE 433
- Page 435 and 436: 6.10. POSTSCRIPT 435When D is an ED
- Page 437 and 438: Chapter 7Proximity problemsIn summa
- Page 439 and 440: In contrast, order of projection on
- Page 441 and 442: 441HS N h0EDM NK = S N h ∩ R N×N
- Page 443 and 444: 4437.0.3 Problem approachProblems t
- Page 445 and 446: 7.1. FIRST PREVALENT PROBLEM: 445fi
- Page 447 and 448: 7.1. FIRST PREVALENT PROBLEM: 4477.
- Page 449 and 450: 7.1. FIRST PREVALENT PROBLEM: 449di
- Page 451 and 452: 7.1. FIRST PREVALENT PROBLEM: 4517.
- Page 453 and 454: 7.1. FIRST PREVALENT PROBLEM: 453wh
- Page 455 and 456: 7.1. FIRST PREVALENT PROBLEM: 455Th
- Page 457 and 458: 7.2. SECOND PREVALENT PROBLEM: 457O
- Page 459 and 460: 7.2. SECOND PREVALENT PROBLEM: 459S
- Page 461 and 462: 7.2. SECOND PREVALENT PROBLEM: 461r
- Page 463 and 464: 7.2. SECOND PREVALENT PROBLEM: 463c
- Page 465 and 466: 7.2. SECOND PREVALENT PROBLEM: 4657
- Page 467 and 468: 7.3. THIRD PREVALENT PROBLEM: 467fo
- Page 469 and 470: 7.3. THIRD PREVALENT PROBLEM: 469a
- Page 471 and 472: 7.3. THIRD PREVALENT PROBLEM: 4717.
- Page 473 and 474: 7.3. THIRD PREVALENT PROBLEM: 4737.
- Page 475 and 476: 7.3. THIRD PREVALENT PROBLEM: 475Ou
- Page 478 and 479: 478 CHAPTER 7. PROXIMITY PROBLEMSth
6.8. DUAL EDM CONE 4316.8.1.7 Schoenberg criterion is discretized membership relationWe show the Schoenberg criterion−VN TDV }N ∈ S N−1+D ∈ S N h⇔ D ∈ EDM N (724)to be a discretized membership relation (2.13.4) between a closed convexcone K and its dual K ∗ like〈y , x〉 ≥ 0 for all y ∈ G(K ∗ ) ⇔ x ∈ K (317)where G(K ∗ ) is any set of generators whose conic hull constructs closedconvex dual cone K ∗ :The Schoenberg criterion is the same as}〈zz T , −D〉 ≥ 0 ∀zz T | 11 T zz T = 0⇔ D ∈ EDM N (1037)D ∈ S N hwhich, by (1038), is the same as〈zz T , −D〉 ≥ 0 ∀zz T ∈ { V N υυ T VN T | υ ∈ RN−1}D ∈ S N h}⇔ D ∈ EDM N (1092)where the zz T constitute a set of generators G for the positive semidefinitecone’s smallest face F ( S N + ∋V ) (6.7.1) that contains auxiliary matrix V .From the aggregate in (1050) we get the ordinary membership relation,assuming only D ∈ S N [147, p.58],〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ EDM N∗ ⇔ D ∈ EDM N(1093)〈D ∗ , D〉 ≥ 0 ∀D ∗ ∈ {δ(u) | u∈ R N } − cone { V N υυ T V T N | υ ∈ RN−1} ⇔ D ∈ EDM NDiscretization yields (317):〈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(1094)