Much Faster Algorithms for Matrix Scaling

Zeyuan Allen-Zhu, Yuanzhi Li, Rafael Oliveira, Avi Wigderson

cs.DS math.CO math.OC

Annotations (0)

No annotations yet.

Select any passage to add the first one.

References

Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent

Zeyuan Allen-Zhu et al. · 2014310 cit.

Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple

Rasmus Kyng et al. · 2016214 cit.

A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps

Martin Idel · 2016146 cit.

Sparsified Cholesky and multigrid solvers for connection laplacians

Rasmus Kyng et al. · 2015132 cit.

Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver

Zeyuan Allen-Zhu et al. · 201573 cit.

Nearly-Linear Time Positive LP Solver with Faster Convergence Rate

Zeyuan Allen-Zhu · 2015

paper7 papers following open source