v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
644 APPENDIX E. PROJECTION When matrix A in (1762) is skinny full-rank (A † A = I) or has orthonormal columns (A T A = I), either property leads to a biorthogonal characterization of nonorthogonal projection: E.1.1 Biorthogonal characterization Any nonorthogonal projector P 2 =P ∈ R m×m projecting on nontrivial R(U) can be defined by a biorthogonality condition Q T U =I ; the biorthogonal decomposition of P being (confer (1762)) where E.3 (B.1.1.1) and where generally (confer (1791)) E.4 P = UQ T , Q T U = I (1765) R(P )= R(U) , N(P )= N(Q T ) (1766) P T ≠ P , P † ≠ P , ‖P ‖ 2 ≠ 1, P 0 (1767) and P is not nonexpansive (1792). (⇐) To verify assertion (1765) we observe: because idempotent matrices are diagonalizable (A.5), [176,3.3, prob.3] they must have the form (1438) P = SΦS −1 = m∑ φ i s i wi T = i=1 k∑ ≤ m i=1 s i w T i (1768) that is a sum of k = rankP independent projector dyads (idempotent dyads,B.1.1,E.6.2.1) where φ i ∈ {0, 1} are the eigenvalues of P [344,4.1, thm.4.1] in diagonal matrix Φ∈ R m×m arranged in nonincreasing E.3 Proof. Obviously, R(P ) ⊆ R(U). Because Q T U = I R(P ) = {UQ T x | x ∈ R m } ⊇ {UQ T Uy | y ∈ R k } = R(U) E.4 Orthonormal decomposition (1788) (conferE.3.4) is a special case of biorthogonal decomposition (1765) characterized by (1791). So, these characteristics (1767) are not necessary conditions for biorthogonality.
E.1. IDEMPOTENT MATRICES 645 order, and where s i ,w i ∈ R m are the right- and left-eigenvectors of P , respectively, which are independent and real. E.5 Therefore U ∆ = S(:,1:k) = [ s 1 · · · s k ] ∈ R m×k (1769) is the full-rank matrix S ∈ R m×m having m − k columns truncated (corresponding to 0 eigenvalues), while ⎡ Q T = ∆ S −1 (1:k, :) = ⎣ w T1 . w T k ⎤ ⎦ ∈ R k×m (1770) is matrix S −1 having the corresponding m − k rows truncated. By the 0 eigenvalues theorem (A.7.3.0.1), R(U)= R(P ) , R(Q)= R(P T ) , and R(P ) = span {s i | φ i = 1 ∀i} N(P ) = span {s i | φ i = 0 ∀i} R(P T ) = span {w i | φ i = 1 ∀i} N(P T ) = span {w i | φ i = 0 ∀i} (1771) Thus biorthogonality Q T U =I is a necessary condition for idempotence, and so the collection of nonorthogonal projectors projecting on R(U) is the affine subset P k =UQ T k where Q k = {Q | Q T U = I , Q∈ R m×k }. (⇒) Biorthogonality is a sufficient condition for idempotence; P 2 = k∑ s i wi T i=1 k∑ s j wj T = P (1772) j=1 id est, if the cross-products are annihilated, then P 2 =P . Nonorthogonal projection of biorthogonal expansion, x on R(P ) has expression like a Px = UQ T x = k∑ wi T xs i (1773) i=1 E.5 Eigenvectors of a real matrix corresponding to real eigenvalues must be real. (A.5.0.0.1)
- 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
- Page 639 and 640: Appendix E Projection For any A∈
- Page 641 and 642: 641 U T = U † for orthonormal (in
- Page 643: E.1. IDEMPOTENT MATRICES 643 where
- Page 647 and 648: E.1. IDEMPOTENT MATRICES 647 When t
- Page 649 and 650: E.3. SYMMETRIC IDEMPOTENT MATRICES
- Page 651 and 652: E.3. SYMMETRIC IDEMPOTENT MATRICES
- Page 653 and 654: E.3. SYMMETRIC IDEMPOTENT MATRICES
- Page 655 and 656: E.5. PROJECTION EXAMPLES 655 E.4.0.
- Page 657 and 658: E.5. PROJECTION EXAMPLES 657 a ∗
- Page 659 and 660: E.5. PROJECTION EXAMPLES 659 E.5.0.
- Page 661 and 662: E.6. VECTORIZATION INTERPRETATION,
- Page 663 and 664: E.6. VECTORIZATION INTERPRETATION,
- Page 665 and 666: E.6. VECTORIZATION INTERPRETATION,
- Page 667 and 668: E.6. VECTORIZATION INTERPRETATION,
- Page 669 and 670: E.7. ON VECTORIZED MATRICES OF HIGH
- Page 671 and 672: E.7. ON VECTORIZED MATRICES OF HIGH
- Page 673 and 674: E.8. RANGE/ROWSPACE INTERPRETATION
- Page 675 and 676: E.9. PROJECTION ON CONVEX SET 675 A
- Page 677 and 678: E.9. PROJECTION ON CONVEX SET 677 W
- Page 679 and 680: E.9. PROJECTION ON CONVEX SET 679 P
- Page 681 and 682: E.9. PROJECTION ON CONVEX SET 681 E
- Page 683 and 684: E.9. PROJECTION ON CONVEX SET 683 T
- Page 685 and 686: E.9. PROJECTION ON CONVEX SET 685
- Page 687 and 688: E.10. ALTERNATING PROJECTION 687 E.
- Page 689 and 690: E.10. ALTERNATING PROJECTION 689 b
- Page 691 and 692: E.10. ALTERNATING PROJECTION 691 a
- Page 693 and 694: E.10. ALTERNATING PROJECTION 693 (a
644 APPENDIX E. PROJECTION<br />
When matrix A in (1762) is skinny full-rank (A † A = I) or has orthonormal<br />
columns (A T A = I), either property leads to a biorthogonal characterization<br />
of nonorthogonal projection:<br />
E.1.1<br />
Biorthogonal characterization<br />
Any nonorthogonal projector P 2 =P ∈ R m×m projecting on nontrivial R(U)<br />
can be defined by a biorthogonality condition Q T U =I ; the biorthogonal<br />
decomposition of P being (confer (1762))<br />
where E.3 (B.1.1.1)<br />
and where generally (confer (1791)) E.4<br />
P = UQ T , Q T U = I (1765)<br />
R(P )= R(U) , N(P )= N(Q T ) (1766)<br />
P T ≠ P , P † ≠ P , ‖P ‖ 2 ≠ 1, P 0 (1767)<br />
and P is not nonexpansive (1792).<br />
(⇐) To verify assertion (1765) we observe: because idempotent matrices<br />
are diagonalizable (A.5), [176,3.3, prob.3] they must have the form (1438)<br />
P = SΦS −1 =<br />
m∑<br />
φ i s i wi T =<br />
i=1<br />
k∑<br />
≤ m<br />
i=1<br />
s i w T i (1768)<br />
that is a sum of k = rankP independent projector dyads (idempotent<br />
dyads,B.1.1,E.6.2.1) where φ i ∈ {0, 1} are the eigenvalues of P<br />
[344,4.1, thm.4.1] in diagonal matrix Φ∈ R m×m arranged in nonincreasing<br />
E.3 Proof. Obviously, R(P ) ⊆ R(U). Because Q T U = I<br />
R(P ) = {UQ T x | x ∈ R m }<br />
⊇ {UQ T Uy | y ∈ R k } = R(U)<br />
<br />
E.4 Orthonormal decomposition (1788) (conferE.3.4) is a special case of biorthogonal<br />
decomposition (1765) characterized by (1791). So, these characteristics (1767) are not<br />
necessary conditions for biorthogonality.