v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
738 APPENDIX E. PROJECTIONProjection on cone K isP K x = (I − 1τ 2a⋆ a ⋆T )x (2018)whereas projection on the polar cone −K ∗ is (E.9.2.2.1)P K ◦x = x − P K x = 1τ 2a⋆ a ⋆T x (2019)Negating vector a , this maximization problem (2016) becomes aminimization (the same problem) and the polar cone becomes the dual cone:E.9.2‖x − P K x‖ = − 1 τ minimize a T xasubject to ‖a‖ ≤ τ (2020)a ∈ K ∗Projection on coneWhen convex set Cconditions:is a cone, there is a finer statement of optimalityE.9.2.0.1 Theorem. Unique projection on cone. [199,A.3.2]Let K ⊆ R n be a closed convex cone, and K ∗ its dual (2.13.1). Then Px isthe unique minimum-distance projection of x∈ R n on K if and only ifPx ∈ K , 〈Px − x, Px〉 = 0, Px − x ∈ K ∗ (2021)In words, Px is the unique minimum-distance projection of x on K ifand only if1) projection Px lies in K2) direction Px−x is orthogonal to the projection Px3) direction Px−x lies in the dual cone K ∗ .As the theorem is stated, it admits projection on K not full-dimensional;id est, on closed convex cones in a proper subspace of R n .⋄
E.9. PROJECTION ON CONVEX SET 739R(P )x − (I −P )xx(I −P )xR(P ) ⊥Figure 165: (confer Figure 83) Given orthogonal projection (I −P )x of xon orthogonal complement R(P ) ⊥ , projection on R(P ) is immediate:x − (I −P )x .Projection on K of any point x∈−K ∗ , belonging to the negative dualcone, is the origin. By (2021): the set of all points reaching the origin, whenprojecting on K , constitutes the negative dual cone; a.k.a, the polar coneK ◦ = −K ∗ = {x∈ R n | Px = 0} (2022)E.9.2.1Relationship to subspace projectionConditions 1 and 2 of the theorem are common with orthogonal projection ona subspace R(P ) : Condition 1 corresponds to the most basic requirement;namely, the projection Px∈ R(P ) belongs to the subspace. Recall theperpendicularity requirement for projection on a subspace;Px − x ⊥ R(P ) or Px − x ∈ R(P ) ⊥ (1907)which corresponds to condition 2.Yet condition 3 is a generalization of subspace projection; id est, forunique minimum-distance projection on a closed convex cone K , polarcone −K ∗ plays the role R(P ) ⊥ plays for subspace projection (Figure 165:
- Page 687 and 688: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 689 and 690: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- Page 691 and 692: D.2. TABLES OF GRADIENTS AND DERIVA
- Page 693 and 694: D.2. TABLES OF GRADIENTS AND DERIVA
- Page 695 and 696: D.2. TABLES OF GRADIENTS AND DERIVA
- Page 697 and 698: D.2. TABLES OF GRADIENTS AND DERIVA
- Page 699 and 700: Appendix EProjectionFor any A∈ R
- Page 701 and 702: 701U T = U † for orthonormal (inc
- Page 703 and 704: E.1. IDEMPOTENT MATRICES 703where A
- Page 705 and 706: E.1. IDEMPOTENT MATRICES 705order,
- Page 707 and 708: E.1. IDEMPOTENT MATRICES 707are lin
- Page 709 and 710: E.3. SYMMETRIC IDEMPOTENT MATRICES
- Page 711 and 712: E.3. SYMMETRIC IDEMPOTENT MATRICES
- Page 713 and 714: E.3. SYMMETRIC IDEMPOTENT MATRICES
- Page 715 and 716: E.4. ALGEBRA OF PROJECTION ON AFFIN
- Page 717 and 718: E.5. PROJECTION EXAMPLES 717a ∗ 2
- Page 719 and 720: E.5. PROJECTION EXAMPLES 719where Y
- Page 721 and 722: E.5. PROJECTION EXAMPLES 721(B.4.2)
- Page 723 and 724: E.6. VECTORIZATION INTERPRETATION,
- Page 725 and 726: E.6. VECTORIZATION INTERPRETATION,
- Page 727 and 728: E.6. VECTORIZATION INTERPRETATION,
- Page 729 and 730: E.7. PROJECTION ON MATRIX SUBSPACES
- Page 731 and 732: E.7. PROJECTION ON MATRIX SUBSPACES
- Page 733 and 734: E.8. RANGE/ROWSPACE INTERPRETATION
- Page 735 and 736: E.9. PROJECTION ON CONVEX SET 735As
- Page 737: E.9. PROJECTION ON CONVEX SET 737Wi
- Page 741 and 742: E.9. PROJECTION ON CONVEX SET 741E.
- Page 743 and 744: E.9. PROJECTION ON CONVEX SET 743E.
- Page 745 and 746: E.9. PROJECTION ON CONVEX SET 745Un
- Page 747 and 748: E.9. PROJECTION ON CONVEX SET 747ac
- Page 749 and 750: E.10. ALTERNATING PROJECTION 749bC
- Page 751 and 752: E.10. ALTERNATING PROJECTION 7510
- Page 753 and 754: E.10. ALTERNATING PROJECTION 753E.1
- Page 755 and 756: E.10. ALTERNATING PROJECTION 755y 2
- Page 757 and 758: E.10. ALTERNATING PROJECTION 757Def
- Page 759 and 760: E.10. ALTERNATING PROJECTION 759Dis
- Page 761 and 762: E.10. ALTERNATING PROJECTION 761mat
- Page 763 and 764: E.10. ALTERNATING PROJECTION 763K
- Page 765 and 766: E.10. ALTERNATING PROJECTION 765E.1
- Page 767 and 768: E.10. ALTERNATING PROJECTION 767E.1
- Page 769 and 770: Appendix FNotation and a few defini
- Page 771 and 772: 771A ij or A(i, j) , ij th entry of
- Page 773 and 774: 773⊞orthogonal vector sum of sets
- Page 775 and 776: 775x +vector x whose negative entri
- Page 777 and 778: 777X point list ((76) having cardin
- Page 779 and 780: 779SDPSVDSNRdBEDMS n 1S n hS n⊥hS
- Page 781 and 782: 781vectorentrycubixquartixfeasible
- Page 783 and 784: 783Oorder of magnitude information
- Page 785 and 786: 785cofmatrix of cofactors correspon
- Page 787 and 788: Bibliography[1] Edwin A. Abbott. Fl
E.9. PROJECTION ON CONVEX SET 739R(P )x − (I −P )xx(I −P )xR(P ) ⊥Figure 165: (confer Figure 83) Given orthogonal projection (I −P )x of xon orthogonal complement R(P ) ⊥ , projection on R(P ) is immediate:x − (I −P )x .Projection on K of any point x∈−K ∗ , belonging to the negative dualcone, is the origin. By (2021): the set of all points reaching the origin, whenprojecting on K , constitutes the negative dual cone; a.k.a, the polar coneK ◦ = −K ∗ = {x∈ R n | Px = 0} (2022)E.9.2.1Relationship to subspace projectionConditions 1 and 2 of the theorem are common with orthogonal projection ona subspace R(P ) : Condition 1 corresponds to the most basic requirement;namely, the projection Px∈ R(P ) belongs to the subspace. Recall theperpendicularity requirement for projection on a subspace;Px − x ⊥ R(P ) or Px − x ∈ R(P ) ⊥ (1907)which corresponds to condition 2.Yet condition 3 is a generalization of subspace projection; id est, forunique minimum-distance projection on a closed convex cone K , polarcone −K ∗ plays the role R(P ) ⊥ plays for subspace projection (Figure 165: