On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms

DOI10.1016/0167-6377(93)90087-WMaRDI QIDQ1318656zbMATH OpenFDO

Authors Bahman Kalantari, Leonid G. Khachiyan

Publication date 6 April 1994

Published in Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

convergencepolynomial-time approximation schemenumber of iterationsRAS matrix scaling algorithms

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)

Recommendations

• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
• On the complexity of nonnegative-matrix scaling
• A Parallel Matrix Scaling Algorithm
• scientific article; zbMATH DE number 1775454
• A Symmetry Preserving Algorithm for Matrix Scaling

Cites work

• scientific article; zbMATH DE number 3311499 (Why is no real title available?)
• A Comparative Study of Algorithms for Matrix Balancing
• A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
• An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
• Approximate max-min resource sharing for structured concave optimization
• Extensions of Jentzsch's Theorem
• On the RAS-algorithm
• On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
• On the scaling of multidimensional matrices
• Scalings of matrices which have prespecified row sums and column sums via optimization
• The diagonal equivalence of a nonnegative matrix to a stochastic matrix

Cited in

(9)

• On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
• Scaling positive random matrices: concentration and asymptotic convergence
• Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
• Matrix scaling and explicit doubly stochastic limits
• Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
• On the complexity of nonnegative-matrix scaling
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
• Scientific contributions of Leo Khachiyan (a short overview)

This page was built for publication: On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318656)