Solving tall dense linear programs in nearly linear time

DOI10.1145/3357713.3384309OpenAlexW3034220602MaRDI QIDQ5144963

Jan van Den Brand, Aaron Sidford, Yin Tat Lee, Zhao Song

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.02304

zbMATH Keywords

interior point methodlinear programnearly linear time

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ Minimum power partial multi-cover on a line ⋮ A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

This page was built for publication: Solving tall dense linear programs in nearly linear time