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

在当前矩阵乘法时间内求解线性规划

Solving Linear Programs in the Current Matrix Multiplication Time

Michael B. Cohen, Yin Tat Lee, Zhao Song

摘要:

本文给出了如何求解$\min_{Ax=b,x\geq0} c^\top x$形式的线性规划,其中$n$变量是时间变量$$O^*((n^ω+n^{2.5-α/2}+n^{2+1/6}) \log(n/δ))$$,其中$ω$是矩阵乘法的指数,$α$是矩阵乘法的对偶指数,$δ$是相对精度。对于$ω\sim2.37$和$α\sim0.31$的当前值,我们的算法需要$O^*(n^ω \log(n/δ))$时间。当$ω= 2$时,我们的算法需要$O^*(n^{2+1/6} \log(n/δ))$时间。我们的算法利用了几个新的概念,我们相信可能是独立的利益:$\bullet$我们定义了一个随机中心路径方法。$\bullet$我们展示了如何在对角矩阵$W$中的$\ell_{2}$乘性变化下在次二次时间中保持投影矩阵$\sqrt{W}A^{\top}(AWA^{\top})^{-1}A\sqrt{W}$。

英文摘要:

This paper shows how to solve linear programs of the form $\min_{Ax=b,x\geq0} c^\top x$ with $n$ variables in time $$O^*((n^ω+n^{2.5-α/2}+n^{2+1/6}) \log(n/δ))$$ where $ω$ is the exponent of matrix multiplication, $α$ is the dual exponent of matrix multiplication, and $δ$ is the relative accuracy. For the current value of $ω\sim2.37$ and $α\sim0.31$, our algorithm takes $O^*(n^ω \log(n/δ))$ time. When $ω= 2$, our algorithm takes $O^*(n^{2+1/6} \log(n/δ))$ time. Our algorithm utilizes several new concepts that we believe may be of independent interest: $\bullet$ We define a stochastic central path method. $\bullet$ We show how to maintain a projection matrix $\sqrt{W}A^{\top}(AWA^{\top})^{-1}A\sqrt{W}$ in sub-quadratic time under $\ell_{2}$ multiplicative changes in the diagonal matrix $W$.

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

↑