Convex Separation from Optimization via Heuristics

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

Convex Separation from Optimization via Heuristics

数据结构与算法 2007-05-23 v1 最优化与控制

作者: 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 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.

关键词

convex optimization computational geometry optimization algorithm

引用

@article{arxiv.cs/0603089,
  title  = {Convex Separation from Optimization via Heuristics},
  author = {Lawrence M. Ioannou and Benjamin C. Travaglione and Donny Cheung},
  journal= {arXiv preprint arXiv:cs/0603089},
  year   = {2007}
}

相关论文

查看更多相关论文 →