v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
612 APPENDIX A. LINEAR ALGEBRAOrigin of the term Schur complement is from complementary inertia:[113,2.4.4] Defineinertia ( G∈ S M) {p,z,n} (1516)where p,z,n respectively represent number of positive, zero, and negativeeigenvalues of G ; id est,M = p + z + n (1517)Then, when A is invertible,and when C is invertible,inertia(G) = inertia(A) + inertia(C − B T A −1 B) (1518)inertia(G) = inertia(C) + inertia(A − BC −1 B T ) (1519)A.4.0.0.1 Example. Equipartition inertia. [55,1.2 exer.17]When A=C = 0, denoting nonincreasingly ordered singular values of matrixB ∈ R m×m by σ(B)∈ R m + , then we have eigenvaluesand[ ] A bb T c([ 0 Bλ(G) = λB T 0])=[σ(B)−Ξσ(B)](1520)inertia(G) = inertia(B T B) + inertia(−B T B) (1521)where Ξ is the order-reversing permutation matrix defined in (1728). A.4.0.0.2 Example. Nonnegative polynomial. [34, p.163]Quadratic multivariate polynomial x T Ax + 2b T x + c is a convex function ofvector x if and only if A ≽ 0, but sublevel set {x | x T Ax + 2b T x + c ≤ 0}is convex if A ≽ 0 yet not vice versa. Schur-form positive semidefinitenessis sufficient for polynomial convexity but necessary and sufficient fornonnegativity:≽ 0 ⇔ [xT 1] [ A bb T c][ x1]≥ 0 ⇔ x T Ax+2b T x+c ≥ 0 (1522)All is extensible to univariate polynomials; e.g., x [t n t n−1 t n−2 · · · t ] T .
A.4. SCHUR COMPLEMENT 613A.4.0.0.3 Example. Schur-form fractional function trace minimization.From (1484),[ ] A BB T ≽ 0 ⇒ tr(A + C) ≥ 0C⇕[ A 00 T C −B T A −1 B]≽ 0 ⇒ tr(C −B T A −1 B) ≥ 0(1523)⇕[ A−BC −1 B T 00 T C]≽ 0 ⇒ tr(A−BC −1 B T ) ≥ 0Since tr(C −B T A −1 B)≥ 0 ⇔ trC ≥ tr(B T A −1 B) ≥ 0 for example, thenminimization of trC is necessary and sufficient [ for ] minimization ofA Btr(C −B T A −1 B) when both are under constraintB T ≽ 0. CA.4.0.1Schur-form nullspace basisFrom (1511),[ A BG =B T C]≽ 0⇕[ A 00 T C −B T A † B]≽ 0 and B T (I −AA † ) = 0(1524)⇕[ A−BC † B T 00 T C]≽ 0 and B(I −CC † ) = 0These facts plus Moore-Penrose condition (E.0.1) provide a partial basis:([ ]) [ ]A B I −AA†0basis NB T ⊇C 0 T I −CC † (1525)
- 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 and 570: 7.2. SECOND PREVALENT PROBLEM: 569S
- Page 571 and 572: 7.2. SECOND PREVALENT PROBLEM: 571r
- 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: A.4. SCHUR COMPLEMENT 611A.4 Schur
- 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.
- Page 621 and 622: A.6. SINGULAR VALUE DECOMPOSITION,
- Page 623 and 624: A.6. SINGULAR VALUE DECOMPOSITION,
- Page 625 and 626: A.7. ZEROS 625A.6.5SVD of symmetric
- Page 627 and 628: A.7. ZEROS 627(Transpose.)Likewise,
- Page 629 and 630: A.7. ZEROS 629For X,A∈ S M +[34,2
- Page 631 and 632: A.7. ZEROS 631A.7.5.0.1 Proposition
- Page 633 and 634: Appendix BSimple matricesMathematic
- Page 635 and 636: B.1. RANK-ONE MATRIX (DYAD) 635R(v)
- Page 637 and 638: B.1. RANK-ONE MATRIX (DYAD) 637B.1.
- Page 639 and 640: B.2. DOUBLET 639R([u v ])R(Π)= R([
- Page 641 and 642: B.3. ELEMENTARY MATRIX 641has N −
- Page 643 and 644: B.4. AUXILIARY V -MATRICES 643is an
- Page 645 and 646: B.4. AUXILIARY V -MATRICES 64514. [
- Page 647 and 648: B.5. ORTHOGONAL MATRIX 647Given X
- Page 649 and 650: B.5. ORTHOGONAL MATRIX 649Figure 15
- Page 651 and 652: B.5. ORTHOGONAL MATRIX 651which is
- Page 653 and 654: Appendix CSome analytical optimal r
- Page 655 and 656: C.2. TRACE, SINGULAR AND EIGEN VALU
- Page 657 and 658: C.2. TRACE, SINGULAR AND EIGEN VALU
- Page 659 and 660: C.2. TRACE, SINGULAR AND EIGEN VALU
- Page 661 and 662: C.3. ORTHOGONAL PROCRUSTES PROBLEM
A.4. SCHUR COMPLEMENT 613A.4.0.0.3 Example. Schur-form fractional function trace minimization.From (1484),[ ] A BB T ≽ 0 ⇒ tr(A + C) ≥ 0C⇕[ A 00 T C −B T A −1 B]≽ 0 ⇒ tr(C −B T A −1 B) ≥ 0(1523)⇕[ A−BC −1 B T 00 T C]≽ 0 ⇒ tr(A−BC −1 B T ) ≥ 0Since tr(C −B T A −1 B)≥ 0 ⇔ trC ≥ tr(B T A −1 B) ≥ 0 for example, thenminimization of trC is necessary and sufficient [ for ] minimization ofA Btr(C −B T A −1 B) when both are under constraintB T ≽ 0. CA.4.0.1Schur-form nullspace basisFrom (1511),[ A BG =B T C]≽ 0⇕[ A 00 T C −B T A † B]≽ 0 and B T (I −AA † ) = 0(1524)⇕[ A−BC † B T 00 T C]≽ 0 and B(I −CC † ) = 0These facts plus Moore-Penrose condition (E.0.1) provide a partial basis:([ ]) [ ]A B I −AA†0basis NB T ⊇C 0 T I −CC † (1525)