Fetching the paper…
Reading the bibliography…
Given a non-negative $n \times m$ real matrix $A$, the {\em matrix scaling} problem is to determine if it is possible to scale the rows and columns so that each row and each column sums to a specified target value for it.
Über die umkehrung der naturgesetze
E. Schrödinger · 1931
Earlier work this paper cites.
On a least squares adjustment of a sampled frequency table when the expected marginal totals are known
W. E. Deming and F. F. Stephan · 1940
Earlier work this paper cites.
Estimating nonnegative matrices from marginal data
M. Bacharach · 1965
Earlier work this paper cites.
The diagonal equivalence of a nonnegative matrix to a stochastic matrix
R. A. Brualdi, S. V. Parter, and H. Schneider · 1966
Earlier work this paper cites.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
L. Bregman · 1967
Earlier work this paper cites.
Reduction of a matrix with positive elements to a doubly stochastic matrix
M. Menon · 1967
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1967
Earlier work this paper cites.
Concerning nonnegative matrices and doubly stochastic matrices
R. Sinkhorn and P. Knopp · 1967
Earlier work this paper cites.
I-divergence geometry of probability distributions and minimization problems
I. Csiszar · 1975
Earlier work this paper cites.
Theoretical properties of biproportional matrix adjustments
S. M. Macgill · 1977
Earlier work this paper cites.
On pairs of multidimensional matrices
T. Raghavan · 1984
Earlier work this paper cites.
An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
R. Bapat and T. Raghavan · 1989
Earlier work this paper cites.
A geometric interpretation of Darroch and Ratcliff’s generalized iterative scaling
I. Csiszar · 1989
Earlier work this paper cites.
On the scaling of multidimensional matrices
J. Franklin and J. Lorenz · 1989
Earlier work this paper cites.
Approximate distributions of order statistics
R.-D. Reiss · 1989
Cited alongside, same era.
Scalings of matrices which have prespecified row sums and column sums via optimization
U. Rothblum and H. Schneider · 1989
Cited alongside, same era.
The rate of convergence of sinkhorn balancing
G. W. Soules · 1991
Cited alongside, same era.
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
B. Kalantari and L. Khachiyan · 1993
Cited alongside, same era.
A parallel approximation algorithm for positive linear programming
M. Luby and N. Nisan · 1993
Cited alongside, same era.
Convergence of the iterative proportional fitting procedure
L. Ruschendorf · 1995
Cited alongside, same era.
Polynomial approximation algorithms for belief matrix maintenance in identity management
H. Balakrishnan, I. Hwang, and C. J. Tomlin · 2004
Later among the works it cites.
Quantum computing and hidden variables
S. Aaronson · 2005
Later among the works it cites.
Matrix scaling by network flow
G. Rote and M. Zachariasen · 2007
Later among the works it cites.
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
B. Kalantari, I. Lari, F. Ricca, and B. Simeone · 2008
Later among the works it cites.
Modelling Transport
J. d. D. Ortúzar and L. G. Willumsen · 2011
Later among the works it cites.
Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel
Z. Allen Zhu and L. Orecchia · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the complexity of nonnegative-matrix scaling
B. Kalantari and L. Khachiyan · 1996
Cited alongside, same era.
The deflation-inflation method for certain semidefinite programming and maximum determinant completion problems
L. Gurvits and P. N. Yianilos · 1998
Cited alongside, same era.
On complexity of matrix scaling
A. Nemirovskii and U. Rothblum · 1999
Cited alongside, same era.
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
N. Linial, A. Samorodnitsky, and A. Wigderson · 2000
Cited alongside, same era.
A User’s Guide to Measure Theoretic Probability
D. Pollard · 2001
Cited alongside, same era.
Sequential and parallel algorithms for mixed packing and covering
N. E. Young · 2001
Cited alongside, same era.
Later among the works it cites.
Upper bounds on the relative entropy and rényi divergence as a function of total variation distance for finite alphabets
I. Sason and S. Verdú · 2015
Later among the works it cites.
A review of matrix scaling and Sinkhorn’s normal form for matrices and positive maps
M. Idel · 2016
Later among the works it cites.
Approximating the Solution to Mixed Packing and Covering LPs in Parallel O ( ε − 3 ) O(\varepsilon^{-3}) Time
M. W. Mahoney, S. Rao, D. Wang, and P. Zhang · 2016
Later among the works it cites.
Much faster algorithms for matrix scaling
Z. Allen Zhu, Y. Li, R. Oliveira, and A. Wigderson · 2017
Later among the works it cites.
Near-linear time approximation algorithms for optimal transport via sinkhorn iteration
J. Altschuler, J. Weed, and P. Rigollet · 2017
Later among the works it cites.
Matrix scaling and balancing via box constrained newton’s method and interior point methods
M. B. Cohen, A. Madry, D. Tsipras, and A. Vladu · 2017
Later among the works it cites.
Statistics stack exchange
Xi’an · 2018
Closest in time.