Convex Optimization · Separation, conjugates, and subgradients
Let C=[-1,1]² ⊂ ℝ² and let z=(3,2)
Problem
Convex Optimization practice problemLet and let . Equip with the Euclidean inner product. Do not treat as a spectrahedron and do not pass through a Fenchel conjugate.
1. Compute the Euclidean projection by clipping each coordinate independently to . Compute the distance exactly.
2. Set . Prove the variational inequality3. Compute the support value and the pairing .
4. Let be the midpoint of the segment from to . Write the midplane and evaluate . Prove that this midplane strictly separates from .
5. Audit both sentences: (i) “because is centered at the origin, the projection of is ”; (ii) “the support of in the direction is the pairing .”
Do not replace the square by a second-order cone or a semidefinite slice, and do not introduce a conjugate calculation.
Hint
HintClipping and to produces . Then and .
Check your work
Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.
The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Convex Optimization sample problem: Try the free sample problem.
More Convex Optimization practice problems
- Let a ∈ ℝⁿ and P ∈ ℝ^(n×n)Conic, second-order cone, and semidefinite optimization