A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices

DOI10.1016/0024-3795(94)00162-6zbMath0846.15003OpenAlexW2087472701MaRDI QIDQ1911415

Bahman Kalantari

Publication date: 28 April 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00162-6

zbMATH Keywords

linear programminglogarithmic barrier functionmultihomogeneous functionconditioning of matricesKarmarkar potential functiondiagonal scaling of matrices

Mathematics Subject Classification ID

Linear programming (90C05) Conditioning of matrices (15A12)

Related Items (9)

Coordinate-wise transformation of probability distributions to achieve a Stein-type identity ⋮ On linear programming and matrix scaling over the algebraic numbers ⋮ On the complexity of nonnegative-matrix scaling ⋮ Scaling symmetric positive definite matrices to prescribed row sums. ⋮ Semidefinite programming and matrix scaling over the semidefinite cone. ⋮ On the complexity of general matrix scaling and entropy minimization via the RAS algorithm ⋮ On the diagonal scaling of Euclidean distance matrices to doubly stochastic matrices ⋮ A procedure of Chvátal for testing feasibility in linear programming and matrix scaling ⋮ An objective general index for multivariate ordered data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Karmarkar's algorithm with improved steps
• An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
• Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
• On the scaling of multidimensional matrices
• Scalings of matrices which have prespecified row sums and column sums via optimization
• Generalization of Karmarkar's algorithm to convex homogeneous functions
• On the RAS-algorithm
• On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
• Diagonal matrix scaling is NP-hard
• On the complexity of nonnegative-matrix scaling
• Concerning nonnegative matrices and doubly stochastic matrices
• Scaling of matrices to achieve specified row and column sums
• On matrices with doubly stochastic pattern
• The diagonal equivalence of a nonnegative matrix to a stochastic matrix
• A Comparative Study of Algorithms for Matrix Balancing
• Diagonal Matrix Scaling and Linear Programming
• A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
• Reduction of a Matrix with Positive Elements to a Doubly Stochastic Matrix
• Convex Sets of Non-Negative Matrices
• The Distribution of Positive Elements in Doubly-Stochastic Matrices
• Note on Nonnegative Matrices

This page was built for publication: A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices