v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
588 APPENDIX B. SIMPLE MATRICES B.4.2 Schoenberg auxiliary matrix V N 1. V N = 1 √ 2 [ −1 T I 2. V T N 1 = 0 3. I − e 1 1 T = [ 0 √ 2V N ] 4. [ 0 √ 2V N ] VN = V N 5. [ 0 √ 2V N ] V = V ] ∈ R N×N−1 6. V [ 0 √ 2V N ] = [ 0 √ 2VN ] 7. [ 0 √ 2V N ] [ 0 √ 2VN ] = [ 0 √ 2VN ] 8. [ 0 √ 2V N ] † = [ 0 0 T 0 I ] V 9. [ 0 √ 2V N ] † V = [ 0 √ 2VN ] † 10. [ 0 √ ] [ √ ] † 2V N 0 2VN = V 11. [ 0 √ [ ] ] † [ √ ] 0 0 T 2V N 0 2VN = 0 I 12. [ 0 √ ] [ ] 0 0 2V T N = [ 0 √ ] 2V 0 I N [ ] [ ] 0 0 T [0 √ ] 0 0 T 13. 2VN = 0 I 0 I 14. [V N 1 √ 2 1 ] −1 = [ ] V † N √ 2 N 1T 15. V † N = √ 2 [ − 1 N 1 I − 1 N 11T] ∈ R N−1×N , ( I − 1 N 11T ∈ S N−1) 16. V † N 1 = 0 17. V † N V N = I
B.4. AUXILIARY V -MATRICES 589 18. V T = V = V N V † N = I − 1 N 11T ∈ S N ( 19. −V † N (11T − I)V N = I , 11 T − I ∈ EDM N) 20. D = [d ij ] ∈ S N h (823) tr(−V DV ) = tr(−V D) = tr(−V † N DV N) = 1 N 1T D 1 = 1 N tr(11T D) = 1 N Any elementary matrix E ∈ S N of the particular form ∑ d ij i,j E = k 1 I − k 2 11 T (1539) where k 1 , k 2 ∈ R , B.7 will make tr(−ED) proportional to ∑ d ij . 21. D = [d ij ] ∈ S N tr(−V DV ) = 1 N 22. D = [d ij ] ∈ S N h ∑ i,j i≠j d ij − N−1 N ∑ d ii = 1 T D1 1 − trD N i tr(−V T N DV N) = ∑ j d 1j 23. For Y ∈ S N B.4.3 V (Y − δ(Y 1))V = Y − δ(Y 1) The skinny matrix ⎡ V ∆ W = ⎢ ⎣ Orthonormal auxiliary matrix V W −1 √ N 1 + −1 N+ √ N −1 N+ √ N . −1 N+ √ N √−1 −1 N · · · √ N −1 N+ √ N ... ... −1 N+ √ N · · · −1 N+ √ N ... −1 N+ √ N ... · · · 1 + −1 N+ √ N . ⎤ ∈ R N×N−1 (1540) ⎥ ⎦ B.7 If k 1 is 1−ρ while k 2 equals −ρ∈R , then all eigenvalues of E for −1/(N −1) < ρ < 1 are guaranteed positive and therefore E is guaranteed positive definite. [261]
- Page 537 and 538: Appendix A Linear algebra A.1 Main-
- Page 539 and 540: A.1. MAIN-DIAGONAL δ OPERATOR, λ
- Page 541 and 542: A.1. MAIN-DIAGONAL δ OPERATOR, λ
- Page 543 and 544: A.2. SEMIDEFINITENESS: DOMAIN OF TE
- Page 545 and 546: A.3. PROPER STATEMENTS 545 (AB) T
- Page 547 and 548: A.3. PROPER STATEMENTS 547 A.3.1 Se
- Page 549 and 550: A.3. PROPER STATEMENTS 549 For A di
- Page 551 and 552: A.3. PROPER STATEMENTS 551 Diagonal
- Page 553 and 554: A.3. PROPER STATEMENTS 553 For A,B
- Page 555 and 556: A.3. PROPER STATEMENTS 555 A.3.1.0.
- Page 557 and 558: A.4. SCHUR COMPLEMENT 557 A.4 Schur
- Page 559 and 560: A.4. SCHUR COMPLEMENT 559 A.4.0.0.2
- Page 561 and 562: A.5. EIGEN DECOMPOSITION 561 When B
- Page 563 and 564: A.5. EIGEN DECOMPOSITION 563 dim N(
- Page 565 and 566: A.6. SINGULAR VALUE DECOMPOSITION,
- Page 567 and 568: A.6. SINGULAR VALUE DECOMPOSITION,
- Page 569 and 570: A.7. ZEROS 569 Given symmetric matr
- Page 571 and 572: A.7. ZEROS 571 (TRANSPOSE.) Likewis
- Page 573 and 574: A.7. ZEROS 573 For X,A∈ S M + [31
- Page 575 and 576: A.7. ZEROS 575 A.7.5.0.1 Propositio
- Page 577 and 578: Appendix B Simple matrices Mathemat
- Page 579 and 580: B.1. RANK-ONE MATRIX (DYAD) 579 R(v
- Page 581 and 582: B.1. RANK-ONE MATRIX (DYAD) 581 ran
- Page 583 and 584: B.2. DOUBLET 583 R([u v ]) R(Π)= R
- Page 585 and 586: B.3. ELEMENTARY MATRIX 585 If λ
- Page 587: B.4. AUXILIARY V -MATRICES 587 the
- Page 591 and 592: B.5. ORTHOGONAL MATRIX 591 B.5 Orth
- Page 593 and 594: B.5. ORTHOGONAL MATRIX 593 Figure 1
- Page 595 and 596: Appendix C Some analytical optimal
- Page 597 and 598: C.2. TRACE, SINGULAR AND EIGEN VALU
- Page 599 and 600: C.2. TRACE, SINGULAR AND EIGEN VALU
- Page 601 and 602: C.2. TRACE, SINGULAR AND EIGEN VALU
- Page 603 and 604: C.3. ORTHOGONAL PROCRUSTES PROBLEM
- Page 605 and 606: C.4. TWO-SIDED ORTHOGONAL PROCRUSTE
- Page 607 and 608: C.4. TWO-SIDED ORTHOGONAL PROCRUSTE
- Page 609 and 610: Appendix D Matrix calculus From too
- Page 611 and 612: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 613 and 614: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 615 and 616: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 617 and 618: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 619 and 620: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 621 and 622: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 623 and 624: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 625 and 626: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 627 and 628: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 629 and 630: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 631 and 632: D.2. TABLES OF GRADIENTS AND DERIVA
- Page 633 and 634: D.2. TABLES OF GRADIENTS AND DERIVA
- Page 635 and 636: D.2. TABLES OF GRADIENTS AND DERIVA
- Page 637 and 638: D.2. TABLES OF GRADIENTS AND DERIVA
B.4. AUXILIARY V -MATRICES 589<br />
18. V T = V = V N V † N = I − 1 N 11T ∈ S N<br />
(<br />
19. −V † N (11T − I)V N = I , 11 T − I ∈ EDM N)<br />
20. D = [d ij ] ∈ S N h (823)<br />
tr(−V DV ) = tr(−V D) = tr(−V † N DV N) = 1 N 1T D 1 = 1 N tr(11T D) = 1 N<br />
Any elementary matrix E ∈ S N of the particular form<br />
∑<br />
d ij<br />
i,j<br />
E = k 1 I − k 2 11 T (1539)<br />
where k 1 , k 2 ∈ R , B.7 will make tr(−ED) proportional to ∑ d ij .<br />
21. D = [d ij ] ∈ S N<br />
tr(−V DV ) = 1 N<br />
22. D = [d ij ] ∈ S N h<br />
∑<br />
i,j<br />
i≠j<br />
d ij − N−1<br />
N<br />
∑<br />
d ii = 1 T D1 1 − trD N<br />
i<br />
tr(−V T N DV N) = ∑ j<br />
d 1j<br />
23. For Y ∈ S N<br />
B.4.3<br />
V (Y − δ(Y 1))V = Y − δ(Y 1)<br />
The skinny matrix<br />
⎡<br />
V ∆ W =<br />
⎢<br />
⎣<br />
Orthonormal auxiliary matrix V W<br />
−1 √<br />
N<br />
1 + −1<br />
N+ √ N<br />
−1<br />
N+ √ N<br />
.<br />
−1<br />
N+ √ N<br />
√−1<br />
−1<br />
N<br />
· · · √<br />
N<br />
−1<br />
N+ √ N<br />
...<br />
...<br />
−1<br />
N+ √ N<br />
· · ·<br />
−1<br />
N+ √ N<br />
...<br />
−1<br />
N+ √ N<br />
...<br />
· · · 1 + −1<br />
N+ √ N<br />
.<br />
⎤<br />
∈ R N×N−1 (1540)<br />
⎥<br />
⎦<br />
B.7 If k 1 is 1−ρ while k 2 equals −ρ∈R , then all eigenvalues of E for −1/(N −1) < ρ < 1<br />
are guaranteed positive and therefore E is guaranteed positive definite. [261]