Diagonal Matrix Scaling and Linear Programming
From MaRDI portal
Publication:4015441
DOI10.1137/0802034zbMath0770.90043OpenAlexW2066917381MaRDI QIDQ4015441
Bahman Kalantari, Leonid G. Khachiyan
Publication date: 13 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0802034
diagonal matrix scalingpositive semidefinite symmetric matrixdoubly quasi-stochastic matrixsimple path-following Newton algorithm
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (16)
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ On linear programming and matrix scaling over the algebraic numbers ⋮ Diagonal matrix scaling is NP-hard ⋮ A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices ⋮ On the complexity of nonnegative-matrix scaling ⋮ Scaling symmetric positive definite matrices to prescribed row sums. ⋮ Matrix Balancing Based Interior Point Methods for Point Set Matching Problems ⋮ Semidefinite programming and matrix scaling over the semidefinite cone. ⋮ An algorithmic separating hyperplane theorem and its applications ⋮ Learning semidefinite regularizers ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ On the complexity of general matrix scaling and entropy minimization via the RAS algorithm ⋮ A procedure of Chvátal for testing feasibility in linear programming and matrix scaling ⋮ Maximum likelihood estimation of cloud height from multi-angle satellite imagery ⋮ Scaling of symmetric matrices by positive diagonal congruence ⋮ A characterization theorem and an algorithm for a convex hull problem
This page was built for publication: Diagonal Matrix Scaling and Linear Programming
