v2010.10.26 - Convex Optimization

v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
12.07.2015 Views

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:

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:

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!