On the RAS-algorithm

DOI10.1007/BF02252097MaRDI QIDQ1256397zbMATH OpenFDO

Authors Bernhard Korte, Achim Bachem

Publication date 1979

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

Input-Output MatricesRas-AlgorithmTransportation Polytopes

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Multisectoral models in economics (91B66)

Cites work

• scientific article; zbMATH DE number 3733623 (Why is no real title available?)
• scientific article; zbMATH DE number 3311499 (Why is no real title available?)
• Minimum norm problems over transportation polytopes
• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
• Sur les tableaux dont les marges et des bornes sont données

Cited in

(8)

• On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
• Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
• Interval-constrained matrix balancing
• The nested Sinkhorn divergence to learn the nested distance
• Network flow methods for electoral systems
• On the complexity of nonnegative-matrix scaling

This page was built for publication: On the RAS-algorithm

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