arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0603089cs.DSmath.OC
收藏

基于启发式算法的凸优化分离

Convex Separation from Optimization via Heuristics

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

摘要:

设$K$是$\mathbb{R}^n$的全维凸子集。我们描述了一个新的多项式时间图灵减少从弱分离问题$K$的弱优化问题$K$是基于几何启发式。我们比较我们的减少,这依赖于分析中心,与标准的,更一般的减少。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑