On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
type: Item
instance of: scholarly article
title: On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
zbMATH Open document ID: 0795.65022
DOI: 10.1016/0167-6377(93)90087-W
author: Bahman Kalantari
author: Leonid G. Khachiyan
published in: Operations Research Letters
publication date: 1994-04-06T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 15A12
zbMATH DE Number: 540810
zbMATH Keywords: convergence
zbMATH Keywords: RAS matrix scaling algorithms
zbMATH Keywords: number of iterations
zbMATH Keywords: polynomial-time approximation scheme
reviewed by: Horst Hollatz
MaRDI profile type: Publication
cites work: Q5592025
cites work: On the RAS-algorithm
cites work: An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
cites work: Extensions of Jentzsch's Theorem
cites work: The diagonal equivalence of a nonnegative matrix to a stochastic matrix
cites work: On the scaling of multidimensional matrices
cites work: Approximate max-min resource sharing for structured concave optimization
cites work: Scalings of matrices which have prespecified row sums and column sums via optimization
cites work: A Comparative Study of Algorithms for Matrix Balancing
cites work: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
description: scientific article; zbMATH DE number 540810