On the Complexity of Matrix Balancing

DOI10.1137/S0895479895289765zbMath0882.65031OpenAlexW1993677524MaRDI QIDQ4337392

Ali Shokoufandeh, Bahman Kalantari, Leonid G. Khachiyan

Publication date: 3 February 1998

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479895289765

zbMATH Keywords

geometric programmingpolynomial time complexitymatrix balancing

Mathematics Subject Classification ID

Nonlinear programming (90C30) Graph theory (including graph drawing) in computer science (68R10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)

Related Items (9)

Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods ⋮ Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory ⋮ Near-linear convergence of the random Osborne algorithm for matrix balancing ⋮ Unnamed Item ⋮ On complexity of matrix scaling ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ On the complexity of general matrix scaling and entropy minimization via the RAS algorithm ⋮ Krylov Method Revisited with an Application to the Localization of Eigenvalues ⋮ Spectral Analysis of Matrix Scaling and Operator Scaling

This page was built for publication: On the Complexity of Matrix Balancing