On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
A new bound on the number of iterations of the method for scaling a matrix with positive entries is given. The bound implies that the method is a polynomial-time approximation scheme.
scientific article; zbMATH DE number 540810