Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
From MaRDI portal
Publication:5550449
DOI10.2307/2314570zbMath0166.03702OpenAlexW2312355711MaRDI QIDQ5550449
Publication date: 1967
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2314570
Related Items
Biwhitening Reveals the Rank of a Count Matrix, Copula modeling for discrete random vectors, Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting), Supervised Optimal Transport, Entropic Approximation of Wasserstein Gradient Flows, The nested Sinkhorn divergence to learn the nested distance, ON THE CONVERGENCE RATE OF POTENTIALS OF BRENIER MAPS, On the Linear Convergence of the Multimarginal Sinkhorn Algorithm, On the scaling of multidimensional matrices, Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods, Generalized scalings satisfying linear equations, Unnamed Item, Semi-discrete optimal transport: hardness, regularization and numerical solution, Polynomial-time algorithms for multimarginal optimal transport problems with structure, A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid, Scaling positive random matrices: concentration and asymptotic convergence, Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm, The Derivatives of Sinkhorn–Knopp Converge, The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations, Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces, Discrete Optimal Transport with Independent Marginals is #P-Hard, Near-linear convergence of the random Osborne algorithm for matrix balancing, Dispersion-constrained martingale Schrödinger problems and the exact joint S\&P 500/VIX smile calibration puzzle, Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport, The Wasserstein metric matrix and its computational property, On some methods for entropy maximization and matrix scaling, Utility/privacy trade-off as regularized optimal transport, A multi-objective interpretation of optimal transport, An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems, Auxiliary information: the raking-ratio empirical process, Iterated Proportional Fitting Procedure and Infinite Products of Stochastic Matrices, Multi-target identity management with decentralized optimal sensor scheduling, On stochasticity preserving methods for the computation of the matrix \(p\)th root, False discovery variance reduction in large scale simultaneous hypothesis tests, Unnamed Item, Order independence and factor convergence in iterative scaling, Convergence of Entropic Schemes for Optimal Transport and Gradient Flows, Scaling, reordering, and diagonal pivoting in ILU preconditionings, Making Tables Additive in the Presence of Zeros, An institutionalized Divvy economy, Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning, Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport, Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation, Multi-target identity management for unknown and time-varying number of targets in clutter, Scaling of symmetric matrices by positive diagonal congruence, Convolutional wasserstein distances, Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling, A generalized projective reconstruction theorem and depth constraints for projective factorization, On the Existence of a Scalar Pressure Field in the Brödinger Problem, Biproportional scaling of matrices and the iterative proportional fitting procedure, Implications of convergence rates in Sinkhorn balancing, Scaling of matrices to achieve specified row and column sums, An entropy minimization approach to second-order variational mean-field games, The spectrum of a nonlinear operator associated with a matrix, Data assimilation: The Schrödinger perspective, Algorithms for proportional matrices in reals and integers, Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge, A note on overrelaxation in the Sinkhorn algorithm, Methods for scaling to doubly stochastic form, Second-order models for optimal transport and cubic splines on the Wasserstein Space, Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem, Iterative Bregman Projections for Regularized Transportation Problems, The rate of convergence of Sinkhorn balancing
