A convex problem with a duality gap
ProofAdvanced⏱ 30 minAdvanced Optimizationduality gapslatercounterexample
Problem
Consider
Show that the problem is convex, compute and , and identify which hypothesis of Slater's theorem fails.
Write a complete argument. Every inequality you use should be one you could state precisely.
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| Pairwise independence does not imply independence | Probability | Proof | 15 min | ||
| Weak duality holds without convexity | Advanced Optimization | Proof | 15 min | ||
| A variable with all moments finite that is not sub-Gaussian | High-Dim Probability | Proof | 30 min | ||
| All directional derivatives exist, yet the function is not differentiable | Foundations | Proof | 30 min | ||
| Complementary slackness and active constraints | Advanced Optimization | Proof | 30 min |