%0 Journal Article
%T Convex Separation from Optimization via Heuristics
%A Lawrence M. Ioannou
%A Benjamin C. Travaglione
%A Donny Cheung
%J Mathematics
%D 2006
%I arXiv
%X 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 problem for $K$ that is based on a geometric heuristic. We compare our reduction, which relies on analytic centers, with the standard, more general reduction.
%U http://arxiv.org/abs/cs/0603089v1