v2007.09.13 - Convex Optimization
v2007.09.13 - Convex Optimization v2007.09.13 - Convex Optimization
448 CHAPTER 7. PROXIMITY PROBLEMS7.1.2 Generic problemPrior to determination of D ⋆ , analytical solution (1118) to Problem 1 isequivalent to solution of a generic rank-constrained projection problem; aEuclidean projection on a rank ρ subset of a PSD cone (on a generallynonconvex subset of the PSD cone boundary ∂S N−1+ when ρ
7.1. FIRST PREVALENT PROBLEM: 449dimension ρ ; 7.7 called rank ρ subset: (185) (219)S N−1+ \ S N−1+ (ρ + 1) = {X ∈ S N−1+ | rankX ≤ ρ} (224)7.1.3 Choice of spectral coneSpectral projection substitutes projection on a polyhedral cone, containinga complete set of eigenspectra, in place of projection on a convex set ofdiagonalizable matrices; e.g., (1138). In this section we develop a method ofspectral projection for constraining rank of positive semidefinite matrices ina proximity problem like (1125). We will see why an orthant turns out to bethe best choice of spectral cone, and why presorting is critical.Define a nonlinear permutation operator π(x) : R n → R n that sorts itsvector argument x into nonincreasing order.7.1.3.0.1 Definition. Spectral projection.Let R be an orthogonal matrix and Λ a nonincreasingly ordered diagonalmatrix of eigenvalues. Spectral projection means unique minimum-distanceprojection of a rotated (R ,B.5.4) nonincreasingly ordered (π) vector (δ)of eigenvaluesπ ( δ(R T ΛR) ) (1127)on a polyhedral cone containing all eigenspectra corresponding to a rank ρsubset of a positive semidefinite cone (2.9.2.1) or the EDM cone (inCayley-Menger form,5.11.2.3).△In the simplest and most common case, projection on a positivesemidefinite cone, orthogonal matrix R equals I (7.1.4.0.1) and diagonalmatrix Λ is ordered during diagonalization (A.5.2). Then spectralprojection simply means projection of δ(Λ) on a subset of the nonnegativeorthant, as we shall now ascertain:It is curious how nonconvex Problem 1 has such a simple analyticalsolution (1118). Although solution to generic problem (1125) is known since1936 [84], Trosset [262,2] first observed its equivalence in 1997 to projection7.7 Recall: affine dimension is a lower bound on embedding (2.3.1), equal to dimensionof the smallest affine set in which points from a list X corresponding to an EDM D canbe embedded.
- 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 and 430: 6.8. DUAL EDM CONE 429has dual affi
- Page 431 and 432: 6.8. DUAL EDM CONE 4316.8.1.7 Schoe
- 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: 7.1. FIRST PREVALENT PROBLEM: 4477.
- 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
- Page 480 and 481: 480 APPENDIX A. LINEAR ALGEBRAA.1.1
- Page 482 and 483: 482 APPENDIX A. LINEAR ALGEBRAA.1.2
- Page 484 and 485: 484 APPENDIX A. LINEAR ALGEBRAonly
- Page 486 and 487: 486 APPENDIX A. LINEAR ALGEBRA(AB)
- Page 488 and 489: 488 APPENDIX A. LINEAR ALGEBRAA.3.1
- Page 490 and 491: 490 APPENDIX A. LINEAR ALGEBRAFor A
- Page 492 and 493: 492 APPENDIX A. LINEAR ALGEBRADiago
- Page 494 and 495: 494 APPENDIX A. LINEAR ALGEBRAFor A
- Page 496 and 497: 496 APPENDIX A. LINEAR ALGEBRAA.3.1
448 CHAPTER 7. PROXIMITY PROBLEMS7.1.2 Generic problemPrior to determination of D ⋆ , analytical solution (1118) to Problem 1 isequivalent to solution of a generic rank-constrained projection problem; aEuclidean projection on a rank ρ subset of a PSD cone (on a generallynonconvex subset of the PSD cone boundary ∂S N−1+ when ρ