v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
570 CHAPTER 7. PROXIMITY PROBLEMSConfinement of G to the geometric center subspace provides numericalstability and no loss of generality (confer (1246)); implicit constraint G1 = 0is otherwise unnecessary.To include constraints on the list X ∈ R n×N , we would first rewrite (1360)minimize − tr(V (D(G) − 2Y )V )G∈S N c , Y ∈ SN h , X∈ Rn×N [ ]〈Φij , G〉 y ijsubject to≽ 0 ,y ijh 2 ij[ ] I XX T ≽ 0GX ∈ CN ≥ j > i = 1... N −1(1361)and then add the constraints, realized here in abstract membership to someconvex set C . This problem realization includes a convex relaxation of thenonconvex constraint G = X T X and, if desired, more constraints on G couldbe added. This technique is discussed in5.4.2.3.5.7.2.2 Minimization of affine dimension in Problem 2When desired affine dimension ρ is diminished, the rank function becomesreinserted into problem (1355) that is then rendered difficult to solve becausefeasible set {D , Y } loses convexity in S N h × R N×N . Indeed, the rank functionis quasiconcave (3.8) on the positive semidefinite cone; (2.9.2.9.2) id est,its sublevel sets are not convex.7.2.2.1 Rank minimization heuristicA remedy developed in [262] [135] [136] [134] introduces convex envelope ofthe quasiconcave rank function: (Figure 154)7.2.2.1.1 Definition. Convex envelope. [198]Convex envelope cenv f of a function f : C →R is defined to be the largestconvex function g such that g ≤ f on convex domain C ⊆ R n . 7.16 △7.16 Provided f ≢+∞ and there exists an affine function h ≤f on R n , then the convexenvelope is equal to the convex conjugate (the Legendre-Fenchel transform) of the convexconjugate of f ; id est, the conjugate-conjugate function f ∗∗ . [199,E.1]
7.2. SECOND PREVALENT PROBLEM: 571rankXgcenv rankXFigure 154: Abstraction of convex envelope of rank function. Rank is aquasiconcave function on positive semidefinite cone, but its convex envelopeis the largest convex function whose epigraph contains it. Vertical barlabelled g measures a trace/rank gap; id est, rank found always exceedsestimate; large decline in trace required here for only small decrease in rank.
- Page 519 and 520: 6.6. VECTORIZATION & PROJECTION INT
- Page 521 and 522: 6.6. VECTORIZATION & PROJECTION INT
- Page 523 and 524: 6.7. A GEOMETRY OF COMPLETION 523(b
- Page 525 and 526: 6.7. A GEOMETRY OF COMPLETION 525[3
- Page 527 and 528: 6.7. A GEOMETRY OF COMPLETION 527wh
- Page 529 and 530: 6.8. DUAL EDM CONE 529to the geomet
- Page 531 and 532: 6.8. DUAL EDM CONE 531Proof. First,
- Page 533 and 534: 6.8. DUAL EDM CONE 533EDM 2 = S 2 h
- Page 535 and 536: 6.8. DUAL EDM CONE 535therefore the
- Page 537 and 538: 6.8. DUAL EDM CONE 537Elegance of t
- Page 539 and 540: 6.8. DUAL EDM CONE 5396.8.1.5 Affin
- Page 541 and 542: 6.8. DUAL EDM CONE 5416.8.1.7 Schoe
- Page 543 and 544: 6.8. DUAL EDM CONE 5430dvec rel ∂
- Page 545 and 546: 6.10. POSTSCRIPT 5456.10 Postscript
- Page 547 and 548: Chapter 7Proximity problemsIn the
- Page 549 and 550: 549project on the subspace, then pr
- Page 551 and 552: 551HS N h0EDM NK = S N h ∩ R N×N
- Page 553 and 554: 5537.0.3 Problem approachProblems t
- Page 555 and 556: 7.1. FIRST PREVALENT PROBLEM: 555fi
- Page 557 and 558: 7.1. FIRST PREVALENT PROBLEM: 5577.
- Page 559 and 560: 7.1. FIRST PREVALENT PROBLEM: 559di
- Page 561 and 562: 7.1. FIRST PREVALENT PROBLEM: 5617.
- Page 563 and 564: 7.1. FIRST PREVALENT PROBLEM: 563wh
- Page 565 and 566: 7.1. FIRST PREVALENT PROBLEM: 565Th
- Page 567 and 568: 7.2. SECOND PREVALENT PROBLEM: 567O
- Page 569: 7.2. SECOND PREVALENT PROBLEM: 569S
- Page 573 and 574: 7.2. SECOND PREVALENT PROBLEM: 573w
- Page 575 and 576: 7.2. SECOND PREVALENT PROBLEM: 5757
- Page 577 and 578: 7.2. SECOND PREVALENT PROBLEM: 577a
- Page 579 and 580: 7.3. THIRD PREVALENT PROBLEM: 579is
- Page 581 and 582: 7.3. THIRD PREVALENT PROBLEM: 581We
- Page 583 and 584: 7.3. THIRD PREVALENT PROBLEM: 583su
- Page 585 and 586: 7.3. THIRD PREVALENT PROBLEM: 585Gi
- Page 587 and 588: 7.3. THIRD PREVALENT PROBLEM: 587Op
- Page 589 and 590: 7.4. CONCLUSION 589filtering, multi
- Page 591 and 592: Appendix ALinear algebraA.1 Main-di
- Page 593 and 594: A.1. MAIN-DIAGONAL δ OPERATOR, λ
- Page 595 and 596: A.1. MAIN-DIAGONAL δ OPERATOR, λ
- Page 597 and 598: A.2. SEMIDEFINITENESS: DOMAIN OF TE
- Page 599 and 600: A.3. PROPER STATEMENTS 599(AB) T
- Page 601 and 602: A.3. PROPER STATEMENTS 601A.3.1Semi
- Page 603 and 604: A.3. PROPER STATEMENTS 603For A dia
- Page 605 and 606: A.3. PROPER STATEMENTS 605Diagonali
- Page 607 and 608: A.3. PROPER STATEMENTS 607For A,B
- Page 609 and 610: A.3. PROPER STATEMENTS 609When B is
- Page 611 and 612: A.4. SCHUR COMPLEMENT 611A.4 Schur
- Page 613 and 614: A.4. SCHUR COMPLEMENT 613A.4.0.0.3
- Page 615 and 616: A.4. SCHUR COMPLEMENT 615From Corol
- Page 617 and 618: A.5. EIGENVALUE DECOMPOSITION 617wh
- Page 619 and 620: A.5. EIGENVALUE DECOMPOSITION 619A.
570 CHAPTER 7. PROXIMITY PROBLEMSConfinement of G to the geometric center subspace provides numericalstability and no loss of generality (confer (1246)); implicit constraint G1 = 0is otherwise unnecessary.To include constraints on the list X ∈ R n×N , we would first rewrite (1360)minimize − tr(V (D(G) − 2Y )V )G∈S N c , Y ∈ SN h , X∈ Rn×N [ ]〈Φij , G〉 y ijsubject to≽ 0 ,y ijh 2 ij[ ] I XX T ≽ 0GX ∈ CN ≥ j > i = 1... N −1(1361)and then add the constraints, realized here in abstract membership to someconvex set C . This problem realization includes a convex relaxation of thenonconvex constraint G = X T X and, if desired, more constraints on G couldbe added. This technique is discussed in5.4.2.3.5.7.2.2 Minimization of affine dimension in Problem 2When desired affine dimension ρ is diminished, the rank function becomesreinserted into problem (1355) that is then rendered difficult to solve becausefeasible set {D , Y } loses convexity in S N h × R N×N . Indeed, the rank functionis quasiconcave (3.8) on the positive semidefinite cone; (2.9.2.9.2) id est,its sublevel sets are not convex.7.2.2.1 Rank minimization heuristicA remedy developed in [262] [135] [136] [134] introduces convex envelope ofthe quasiconcave rank function: (Figure 154)7.2.2.1.1 Definition. <strong>Convex</strong> envelope. [198]<strong>Convex</strong> envelope cenv f of a function f : C →R is defined to be the largestconvex function g such that g ≤ f on convex domain C ⊆ R n . 7.16 △7.16 Provided f ≢+∞ and there exists an affine function h ≤f on R n , then the convexenvelope is equal to the convex conjugate (the Legendre-Fenchel transform) of the convexconjugate of f ; id est, the conjugate-conjugate function f ∗∗ . [199,E.1]