v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
736 APPENDIX E. PROJECTION∂H −C(a)P C xH −H +κaP ∂H− xx(b)Figure 164: Dual interpretation of projection of point x on convex set Cin R 2 . (a) κ = (a T a) −1( a T x − σ C (a) ) (b) Minimum distance from x toC is found by maximizing distance to all hyperplanes supporting C andseparating it from x . A convex problem for any convex set, distance ofmaximization is unique.
E.9. PROJECTION ON CONVEX SET 737With reference to Figure 164, identifyingthenH + = {y ∈ R n | a T y ≥ σ C (a)} (107)‖x − P C x‖ = sup ‖x − P ∂H− x‖ = sup ‖a(a T a) −1 (a T x − σ C (a))‖∂H − | x∈H + a | x∈H += supa | x∈H +1‖a‖ |aT x − σ C (a)|(2013)which can be expressed as a convex optimization, for arbitrary positiveconstant τ‖x − P C x‖ = 1 τ maximize a T x − σ C (a)a(2014)subject to ‖a‖ ≤ τThe unique minimum-distance projection on convex set C is thereforewhere optimally ‖a ⋆ ‖= τ .P C x = x − a ⋆( a ⋆T x − σ C (a ⋆ ) ) 1τ 2 (2015)E.9.1.1.1 Exercise. Dual projection technique on polyhedron.Test that projection paradigm from Figure 164 on any convex polyhedralset.E.9.1.2Dual interpretation of projection on coneIn the circumstance set C is a closed convex cone K and there exists ahyperplane separating given point x from K , then optimal σ K (a ⋆ ) takesvalue 0 [199,C.2.3.1]. So problem (2014) for projection of x on K becomes‖x − P K x‖ = 1 τ maximize a T xasubject to ‖a‖ ≤ τ (2016)a ∈ K ◦The norm inequality in (2016) can be handled by Schur complement (3.5.2).Normals a to all hyperplanes supporting K belong to the polar coneK ◦ = −K ∗ by definition: (319)a ∈ K ◦ ⇔ 〈a, x〉 ≤ 0 for all x ∈ K (2017)
- Page 685 and 686: D.1. DIRECTIONAL DERIVATIVE, TAYLOR
- 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: E.9. PROJECTION ON CONVEX SET 735As
- Page 739 and 740: E.9. PROJECTION ON CONVEX SET 739R(
- 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
E.9. PROJECTION ON CONVEX SET 737With reference to Figure 164, identifyingthenH + = {y ∈ R n | a T y ≥ σ C (a)} (107)‖x − P C x‖ = sup ‖x − P ∂H− x‖ = sup ‖a(a T a) −1 (a T x − σ C (a))‖∂H − | x∈H + a | x∈H += supa | x∈H +1‖a‖ |aT x − σ C (a)|(2013)which can be expressed as a convex optimization, for arbitrary positiveconstant τ‖x − P C x‖ = 1 τ maximize a T x − σ C (a)a(2014)subject to ‖a‖ ≤ τThe unique minimum-distance projection on convex set C is thereforewhere optimally ‖a ⋆ ‖= τ .P C x = x − a ⋆( a ⋆T x − σ C (a ⋆ ) ) 1τ 2 (2015)E.9.1.1.1 Exercise. Dual projection technique on polyhedron.Test that projection paradigm from Figure 164 on any convex polyhedralset.E.9.1.2Dual interpretation of projection on coneIn the circumstance set C is a closed convex cone K and there exists ahyperplane separating given point x from K , then optimal σ K (a ⋆ ) takesvalue 0 [199,C.2.3.1]. So problem (2014) for projection of x on K becomes‖x − P K x‖ = 1 τ maximize a T xasubject to ‖a‖ ≤ τ (2016)a ∈ K ◦The norm inequality in (2016) can be handled by Schur complement (3.5.2).Normals a to all hyperplanes supporting K belong to the polar coneK ◦ = −K ∗ by definition: (319)a ∈ K ◦ ⇔ 〈a, x〉 ≤ 0 for all x ∈ K (2017)