Convex Separation from Optimization via Heuristics

Lawrence M. Ioannou, Benjamin C. Travaglione, Donny Cheung

Let $K$ be a full-dimensional convex subset of ${\mathbb{R}}^n$. We describe a new polynomial-time Turing reduction from the weak separation problem for $K$ to the weak optimization…