Convex Separation from Optimization via Heuristics

Simple item page
dc.creatorIoannou, Lawrence M.
dc.creatorTravaglione, Benjamin C.
dc.creatorCheung, Donny
dc.date2006-03-22
dc.date.accessioned2026-07-07T07:05:54Z
dc.date.available2026-07-07T07:05:54Z
dc.descriptionLet $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.
dc.identifierhttps://arxiv.org/abs/cs/0603089
dc.identifierhttp://arxiv.org/abs/cs/0603089
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109832
dc.subjectData Structures and Algorithms
dc.subjectOptimization and Control
dc.titleConvex Separation from Optimization via Heuristics
dc.typetext

Files

Collections

arXiv