arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.04874cs.DScs.DMcs.NAmath.NAmath.OC
收藏

一种更快的切割平面方法及其对组合和凸优化的影响

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization

MIT(麻省理工学院);UC Berkeley(加州大学伯克利分校)

Yin Tat Lee, Aaron Sidford, Sam Chiu-wai Wong

AI总结:

该研究提出了一种更高效的切割平面方法,改进了在凸集内找到点的时间复杂度,并在连续和组合优化的经典问题中取得了更优的运行时间。

摘要:

本文改进了在凸集内寻找点的运行时间,特别是在给定分离 oracle 的情况下。具体而言,给定一个凸集 $K\subset \mathbb{R}^n$ 包含在半径为 $R$ 的盒子里的分离 oracle,我们展示如何通过期望 $O(n\log(nR/ε))$ 次 oracle 评估和额外时间 $O(n^3\log^{O(1)}(nR/ε))$ 来找到 $K$ 中的点或证明 $K$ 不包含半径为 $ε$ 的球。这匹配了 oracle 复杂度并改进了之前最快的算法在 25 年前由 Vaidya 实现的额外时间 $O(n^{ω+1}\log(nR/ε))$,当 $R/ε=n^{O(1)}$ 时,当前矩阵乘法常数 $ω<2.373$。通过结合标准缩减和新方法,我们的算法在连续和组合优化的经典问题中取得了改进的运行时间:子模最小化:我们的弱多项式和强多项式时间算法的运行时间为 $O(n^2\log nM\cdot\text{EO}+n^3\log^{O(1)}nM)$ 和 $O(n^3\log^2 n\cdot\text{EO}+n^4\log^{O(1)}n)$,优于之前的最佳 $O((n^4\text{EO}+n^5)\log M)$ 和 $O(n^5\text{EO}+n^6)$。Matroid 交集:我们的运行时间是 $O(nrT_{\text{rank}}\log n\log (nM) +n^3\log^{O(1)}(nM))$ 和 $O(n^2\log (nM) T_{\text{ind}}+n^3 \log^{O(1)} (nM))$,在查询复杂度上首次达到二次界。在无权情况下,这是自 1986 年以来首次改进。子模流:我们的运行时间是 $O(n^2\log nCU\cdot\text{EO}+n^3\log^{O(1)}nCU)$,优于 15 年前的最佳结果,大致提高了 $O(n^4)$ 倍。半定规划:我们的运行时间是 $\tilde{O}(n(n^2+m^ω+S))$,优于之前的最佳 $\tilde{O}(n(n^ω+m^ω+S))$,在非零元素数量 $S$ 较小时的范围内。

英文摘要:

We improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set $K\subset \mathbb{R}^n$ contained in a box of radius $R$, we show how to either find a point in $K$ or prove that $K$ does not contain a ball of radius $ε$ using an expected $O(n\log(nR/ε))$ oracle evaluations and additional time $O(n^3\log^{O(1)}(nR/ε))$. This matches the oracle complexity and improves upon the $O(n^{ω+1}\log(nR/ε))$ additional time of the previous fastest algorithm achieved over 25 years ago by Vaidya for the current matrix multiplication constant $ω<2.373$ when $R/ε=n^{O(1)}$. Using a mix of standard reductions and new techniques, our algorithm yields improved runtimes for solving classic problems in continuous and combinatorial optimization: Submodular Minimization: Our weakly and strongly polynomial time algorithms have runtimes of $O(n^2\log nM\cdot\text{EO}+n^3\log^{O(1)}nM)$ and $O(n^3\log^2 n\cdot\text{EO}+n^4\log^{O(1)}n)$, improving upon the previous best of $O((n^4\text{EO}+n^5)\log M)$ and $O(n^5\text{EO}+n^6)$. Matroid Intersection: Our runtimes are $O(nrT_{\text{rank}}\log n\log (nM) +n^3\log^{O(1)}(nM))$ and $O(n^2\log (nM) T_{\text{ind}}+n^3 \log^{O(1)} (nM))$, achieving the first quadratic bound on the query complexity for the independence and rank oracles. In the unweighted case, this is the first improvement since 1986 for independence oracle. Submodular Flow: Our runtime is $O(n^2\log nCU\cdot\text{EO}+n^3\log^{O(1)}nCU)$, improving upon the previous bests from 15 years ago roughly by a factor of $O(n^4)$. Semidefinite Programming: Our runtime is $\tilde{O}(n(n^2+m^ω+S))$, improving upon the previous best of $\tilde{O}(n(n^ω+m^ω+S))$ for the regime where the number of nonzeros $S$ is small.

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

↑