A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
From MaRDI portal
Publication:5345008
Cited in
(only showing first 100 items - show all)- A mean field game model for the evolution of cities
- Convergence of entropic schemes for optimal transport and gradient flows
- Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces
- On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
- A hierarchically low-rank optimal transport dissimilarity measure for structured data
- Explicitly preconditioned conjugate gradient method for the solution of unsymmetric linear systems
- Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data
- Order independence and factor convergence in iterative scaling
- Some examples of kinetic schemes whose diffusion limit is Il'in's exponential-fitting
- The scaling mean and a law of large permanents
- On the cardinality of complex matrix scalings
- New inequalities for the Hadamard product of an \(M\)-matrix and an inverse \(M\)-matrix
- Hybrid twins based on optimal transport
- Bayesian estimation of generalized partition of unity copulas
- The spectrum of a nonlinear operator associated with a matrix
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
- A robust hybrid method for nonrigid image registration
- Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems
- Optimal transport: discretization and algorithms
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Conformal mirror descent with logarithmic divergences
- Some inequalities for the minimum eigenvalue of the Hadamard product of an M-matrix and its inverse
- On Schrödinger's bridge problem
- Two-unitary complex Hadamard matrices of order 36
- Asymptotics for semidiscrete entropic optimal transport
- On the existence of a scalar pressure field in the Brödinger problem
- The backtrack Hölder gradient method with application to min-max and min-min problems
- Learning semidefinite regularizers
- Sinkhorn normal form for unitary matrices
- Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
- Scalings of matrices which have prespecified row sums and column sums via optimization
- Robust Hadamard matrices, unistochastic rays in Birkhoff polytope and equi-entangled bases in composite spaces
- Reduction of a Matrix with Positive Elements to a Doubly Stochastic Matrix
- Randomized methods for computing optimal transport without regularization and their convergence analysis
- Partitions of the polytope of doubly substochastic matrices
- Generalized Functions of Symmetric Matrices
- Modeling questions for quantum permutations
- Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons
- Fast and asymptotic steering to a steady state for networks flows
- Calculation of the permanent of a sparse positive matrix
- Convex relaxations for permutation problems
- Raking-ratio empirical process with auxiliary information learning
- Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
- Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
- Semidual regularized optimal transport
- Quantum computing and hidden variables
- Shared Prior Learning of Energy-Based Models for Image Reconstruction
- Majorization, doubly stochastic matrices, and comparison of eigenvalues
- A generalized matrix inverse that is consistent with respect to diagonal transformations
- New lower bounds on eigenvalue of the Hadamard product of an \(M\)-matrix and its inverse
- A gradient descent perspective on Sinkhorn
- An inequality for the Hadamard product of an M-matrix and an inverse M- matrix
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
- A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
- Novel global and local 3D atom-based linear descriptors of the Minkowski distance matrix: theory, diversity-variability analysis and QSPR applications
- Scaling positive random matrices: concentration and asymptotic convergence
- Fractional Sylvester–Gallai theorems
- Scaling a Unitary Matrix
- Nonchordal positive semidefinite stochastic matrices∗
- False discovery variance reduction in large scale simultaneous hypothesis tests
- Multi-unitary complex Hadamard matrices
- Positive contraction mappings for classical and quantum Schrödinger systems
- A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature
- Annihilating entanglement between cones
- Sinkhorn Algorithm for Quantum Permutation Groups
- On matrices with doubly stochastic pattern
- Nonnegative tensors revisited: plane stochastic tensors
- Entropic approximation of Wasserstein gradient flows
- Measuring exposure to dependence risk with random Bernstein copula scenarios
- Supervised optimal transport
- Operator scaling: theory and applications
- Matrix Balancing Based Interior Point Methods for Point Set Matching Problems
- Entropical optimal transport, Schrödinger's system and algorithms
- A variational equivalent to diagonal scaling
- Global Optimization via Schrödinger–Föllmer Diffusion
- Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata
- The square root normal field distance and unbalanced optimal transport
- Linear G-functions†
- Rank bounds for design matrices with block entries and geometric applications
- Vector Monte Carlo stochastic matrix-based algorithms for large linear systems
- Non-negative low-rank approximations for multi-dimensional arrays on statistical manifold
- scientific article; zbMATH DE number 7660126 (Why is no real title available?)
- Scaling algorithms for unbalanced optimal transport problems
- From optimal transport to discrepancy
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- On a conjecture of Fiedler and Markham
- Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data
- Quantum entropic regularization of matrix-valued optimal transport
- Methods for scaling to doubly stochastic form
- A Scalable Deep Learning Approach for Solving High-Dimensional Dynamic Optimal Transport
- The theory and applications of complex matrix scalings
- Scaling of matrices to achieve specified row and column sums
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- Lower and upper bounds on nonunital qubit channel capacities
- Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods
- Alternating projection method for solving doubly stochastic inverse singular value problems with prescribed entries
- Permanents, \(\alpha\)-permanents and Sinkhorn balancing
- Obtaining a Trapezoidal Distribution
- On the geometry and dynamical formulation of the Sinkhorn algorithm for optimal transport
- A linear finite-difference scheme for approximating Randers distances on Cartesian grids
This page was built for publication: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5345008)