Computing optimal scalings by parametric network algorithms
A symmetric scaling of a matrix \(A_{n\times n}\neq 0\) is a matrix of the form \(A'=XAX^{-1}\), where X is a nonnegative, nonsingular, diagonal matrix. Analogously, an asymmetric scaling of a matrix \(B_{m\times n}\) is a matrix of the form \(B'=XBY^{-1}.\) The authors consider two optimization problems. The first one is to find a scaling A' of a square matrix A, such that max\(| a'\!_{ij}|\) is minimal. The second is to find an asymmetric scaling B' of B, such that \(\max_{b'\!_{k\ell}\neq 0}| b'\!_{ij}/b'\!_{k\ell}|\) is minimal. The second problem is considered also if B is a square matrix. The authors show that these problems can be restated as parametric network optimization problems with one and two parameters in the goal function and the right-hand side, respectively. There exist well known algorithms solving these cases.
- Applications of shortest path algorithms to matrix scalings
- Scaling Matrices to Prescribed Row and Column Maxima
- A Symmetry Preserving Algorithm for Matrix Scaling
- Scalings of matrices satisfying line-product constraints and generalizations
- Scalings of matrices which have prespecified row sums and column sums via optimization
- A characterization of the minimum cycle mean in a digraph
- A Class Of Abelian Groups
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
- An Algorithm for Scaling Matrices
- An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
- Applications of shortest path algorithms to matrix scalings
- Characterizations of optimal scalings of matrices
- Combinatorial Optimization with Rational Objective Functions
- Cones, graphs and optimal scalings of matrices
- Evolution of linear programming computing techniques
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3561084 (Why is no real title available?)
- scientific article; zbMATH DE number 3302125 (Why is no real title available?)
- scientific article; zbMATH DE number 3311499 (Why is no real title available?)
- scientific article; zbMATH DE number 3313421 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- On the approximation of a function of several variables by the sum of functions of fewer variables
- On the Automatic Scaling of Matrices for Gaussian Elimination
- Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
- Optimally scaled matrices
- Parametric shortest path algorithms with an application to cyclic staffing
- Remarks on optimally scaled matrices
- Scaling algorithms for network problems
- Generalized scalings satisfying linear equations
- Characterizations of max-balanced flows
- Balancing problems in acyclic networks
- An approximation algorithm for a general class of multi-parametric optimization problems
- An approximation algorithm for a general class of parametric optimization problems
- Numerical upscaling of discrete network models
- On scaling linear programs—some experimental results
- Scaling Matrices to Prescribed Row and Column Maxima
- Optimal Block Diagonal l₂ -Scaling of Matrices
- Scaling: a canonical design problem for networks
- Applications of max algebra to diagonal scaling of matrices
- MinT: A Database for Optimal Net Parameters
- Applications of shortest path algorithms to matrix scalings
This page was built for publication: Computing optimal scalings by parametric network algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691441)