Cones, graphs and optimal scalings of matrices
From MaRDI portal
Publication:3871026
DOI10.1080/03081087908817308zbMath0433.15005MaRDI QIDQ3871026
Hans Schneider, B. David Saunders
Publication date: 1979
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.6576
Related Items
Applications of shortest path algorithms to matrix scalings, On diagonal products of doubly stochastic matrices, A bound for the determinant of certain Hadamard products and for the determinant of the sum of two normal matrices, Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data, Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming, A reverse Hadamard inequality, A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds, Computing optimal scalings by parametric network algorithms, Additive decomposition of nonnegative matrices with applications to permanents and scalingt, Characterizations of optimal scalings of matrices
Cites Work
- Optimally scaled matrices
- Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
- On sum-symmetric matrices
- Cyclic and diagonal products on a matrix
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- An Algorithm for Scaling Matrices
- Applications of the Gordan–Stiemke Theorem in Combinatorial Matrix Theory
- On a System of Inequalities in Demand Analysis: An Extension of the Classical Method
- Energy Conserving Norms for the Solution of Hyperbolic Systems of Partial Differential Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
