Scalings of matrices which have prespecified row sums and column sums via optimization
From MaRDI portal
Publication:1123947
DOI10.1016/0024-3795(89)90491-6zbMath0678.15004OpenAlexW2047354852MaRDI QIDQ1123947
Hans Schneider, Uriel G. Rothblum
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90491-6
Convex programming (90C25) Applications of mathematical programming (90C90) Conditioning of matrices (15A12)
Related Items (33)
The repair paradigm and application to conservation laws ⋮ Continuity of f-projections and applications to the iterative proportional fitting procedure ⋮ Network flow methods for electoral systems ⋮ Existence of matrices with prescribed off-diagonal block element maxima ⋮ A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices ⋮ On the existence of sequences and matrices with prescribed partial sums of elements ⋮ On the convergence of power scaled Cesàro sums ⋮ On the complexity of nonnegative-matrix scaling ⋮ Matrix scaling: A geometric proof of Sinkhorn's theorem ⋮ Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions ⋮ Brunn--Minkowski inequalities for contingency tables and integer flows ⋮ Generalized scalings satisfying linear equations ⋮ Unnamed Item ⋮ Diagonal Scalings for the Eigenstructure of Arbitrary Pencils ⋮ On the number of ordinary lines determined by sets in complex space ⋮ Sequential importance sampling for estimating expectations over the space of perfect matchings ⋮ Scaling symmetric positive definite matrices to prescribed row sums. ⋮ Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem ⋮ Existence of matrices with prescribed Off-diagonal block element sums ⋮ On complexity of matrix scaling ⋮ On the complexity of general matrix scaling and entropy minimization via the RAS algorithm ⋮ False discovery variance reduction in large scale simultaneous hypothesis tests ⋮ Rank bounds for design matrices with block entries and geometric applications ⋮ Order independence and factor convergence in iterative scaling ⋮ Scalings of matrices satisfying line-product constraints and generalizations ⋮ Characterizations of max-balanced flows ⋮ Scaling of symmetric matrices by positive diagonal congruence ⋮ Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling ⋮ Biproportional scaling of matrices and the iterative proportional fitting procedure ⋮ Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data ⋮ Contention resolution, matrix scaling and fair allocation ⋮ On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms ⋮ IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
- Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
- On the scaling of multidimensional matrices
- Generalized scalings satisfying linear equations
- On some methods for entropy maximization and matrix scaling
- Concerning nonnegative matrices and doubly stochastic matrices
- Scaling of matrices to achieve specified row and column sums
- The spectrum of a nonlinear operator associated with a matrix
- The diagonal equivalence of a nonnegative matrix to a stochastic matrix
- Classifications of Nonnegative Matrices Using Diagonal Equivalence
- Applications of the Gordan–Stiemke Theorem in Combinatorial Matrix Theory
- Properties of Kruithof's Projection Method
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Reduction of a Matrix with Positive Elements to a Doubly Stochastic Matrix
- Convex Sets of Non-Negative Matrices
- Matrix Links, An Extremization Problem, and the Reduction of a Non-Negative Matrix to One With Prescribed Row and Column Sums
This page was built for publication: Scalings of matrices which have prespecified row sums and column sums via optimization
