A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix-Reference-Cited by-同舟云学术

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Dadush Daniel¹,Huiberts Sophie¹,Natura Bento²,Végh László A.²

Affiliation:

1. CWI, Netherlands

2. London School of Economics and Political Science, UK

Funder

European Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3357713.3384326

Reference53 articles.

1. Log-barrier interior point methods are not strongly polynomial;Allamigeon Xavier;SIAM Journal on Applied Algebra and Geometry,2018

2. Sébastien Bubeck and Ronen Eldan. 2014. The entropic barrier: a simple and optimal universal self-concordant barrier. arXiv preprint arXiv:1412. 1587. Sébastien Bubeck and Ronen Eldan. 2014. The entropic barrier: a simple and optimal universal self-concordant barrier. arXiv preprint arXiv:1412. 1587.

3. Sergei Chubanov. 2014. A polynomial algorithm for linear optimization which is strongly polynomial under certain conditions on optimal solutions. ( 2014 ). http://www.optimization-online.org/DB_HTML/ 2014 /12/4710.html. Sergei Chubanov. 2014. A polynomial algorithm for linear optimization which is strongly polynomial under certain conditions on optimal solutions. ( 2014 ). http://www.optimization-online.org/DB_HTML/ 2014 /12/4710.html.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix;Mathematical Programming;2023-04-29

3. An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem;Integer Programming and Combinatorial Optimization;2023

4. Minimizing Convex Functions with Rational Minimizers;Journal of the ACM;2022-12-19

5. Interior point methods are not worse than Simplex;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10