Convex Optimization · Conic, second-order cone, and semidefinite optimization
Let a ∈ ℝⁿ and P ∈ ℝ^(n×n)
Problem
Convex Optimization practice problemLet and . For a decision consider the worst-case linear form under Euclidean-ball uncertaintyTake the concrete data1. Prove that the worst-case value equals , and that a maximizing (when ) is the unit vector .
2. Evaluate , , the maximizing , and the robust value exactly at the given .
3. Write the robust inequalityas a second-order-cone constraint whose right-hand side is required to be nonnegative. State the nonnegativity condition explicitly.
4. Substitute the given and compute the SOC slack . Confirm that the right-hand side is positive and that the inequality holds.
5. Audit both sentences: (i) “ may be replaced by the operator-norm bound , so the robust value is ”; (ii) “the SOC form is valid even when is negative, so nonnegativity of the right-hand side can be omitted.”
Do not replace the Euclidean uncertainty set by an box, and do not introduce a semidefinite lift.
Hint
Hintand , whose Euclidean norm is .
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 C=[-1,1]² ⊂ ℝ² and let z=(3,2)Separation, conjugates, and subgradients