A simple polynomial-time rescaling algorithm for solving linear programs
From MaRDI portal
Publication:5901080
DOI10.1145/1007352.1007404zbMath1192.90116OpenAlexW2065043565MaRDI QIDQ5901080
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007404
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (6)
Examples with decreasing largest inscribed ball for deterministic rescaling algorithms ⋮ On the Power of Learning from k-Wise Queries ⋮ Smoothed analysis of condition numbers and complexity implications for linear programming ⋮ A complete characterization of statistical query learning with applications to evolvability ⋮ Conditioning of random conic systems under a general family of input distributions ⋮ Statistical active learning algorithms for noise tolerance and differential privacy
This page was built for publication: A simple polynomial-time rescaling algorithm for solving linear programs
