scientific article; zbMATH DE number 7122315

DOI10.4230/OASICS.SOSA.2018.4zbMath1433.65071arXiv1801.02790MaRDI QIDQ5240418

Sanjeev Khanna, Deeparnab Chakrabarty

Publication date: 25 October 2019

Full work available at URL: https://arxiv.org/abs/1801.02790

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

entropy minimizationmatrix scalingKL-divergence inequalities

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Numerical computation of matrix norms, conditioning, scaling (65F35) Measures of information, entropy (94A17) Conditioning of matrices (15A12)

Related Items (3)

Near-linear convergence of the random Osborne algorithm for matrix balancing ⋮ A gradient descent perspective on Sinkhorn ⋮ Scaling matrices and counting the perfect matchings in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rate of convergence of Sinkhorn balancing
• On pairs of multidimensional matrices
• An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
• On the scaling of multidimensional matrices
• Scalings of matrices which have prespecified row sums and column sums via optimization
• I-divergence geometry of probability distributions and minimization problems
• On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
• A geometric interpretation of Darroch and Ratcliff's generalized iterative scaling
• Convergence of the iterative proportional fitting procedure
• On the complexity of nonnegative-matrix scaling
• On complexity of matrix scaling
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
• Concerning nonnegative matrices and doubly stochastic matrices
• The diagonal equivalence of a nonnegative matrix to a stochastic matrix
• Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
• A parallel approximation algorithm for positive linear programming
• Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel
• Estimating Nonnegative Matrices from Marginal Data
• Reduction of a Matrix with Positive Elements to a Doubly Stochastic Matrix
• Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

This page was built for publication: