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

@article{Dadush2019ASA, title={A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix}, author={Daniel Dadush and Sophie Huiberts and Bento Natura and L{\'a}szl{\'o} A. V{\'e}gh}, journal={ArXiv}, year={2019}, volume={abs/1912.06252} }

textabstractFollowing the breakthrough work of Tardos in the bit-complexity model,
Vavasis and Ye gave the first exact algorithm for linear programming in the
real model of computation with running time depending only on the constraint
matrix. For solving a linear program (LP) $\max\, c^\top x,\: Ax = b,\: x \geq
0,\: A \in \mathbb{R}^{m \times n}$, Vavasis and Ye developed a primal-dual
interior point method using a 'layered least squares' (LLS) step, and showed
that $O(n^{3.5} \log… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 57 REFERENCES