A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds

DOI10.1007/BF02591905zbMath0546.65019OpenAlexW1975314346MaRDI QIDQ3336583

Hans Schneider, Uriel G. Rothblum, Manfred von Golitschek

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591905

zbMATH Keywords

theorem of the alternativescalingsconforming decompositionsminimal support solutionspredetermined upper and lower bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems, On scaling linear programs—some experimental results, Applications of shortest path algorithms to matrix scalings, Computing optimal scalings by parametric network algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimally scaled matrices
• Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
• An automatic scaling procedure for a D'yakonov-Gunn iteration scheme
• An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
• Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
• Cyclic and diagonal products on a matrix
• Remarks on optimally scaled matrices
• Evolution of Linear Programming Computing Techniques
• A Class Of Abelian Groups
• An Algorithm for Scaling Matrices
• Cones, graphs and optimal scalings of matrices
• Algorithms for Testing the Diagonal Similarity of Matrices and Related Problems
• On the Automatic Scaling of Matrices for Gaussian Elimination