A simple polynomial-time rescaling algorithm for solving linear programs
- 27 February 2007
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 114 (1) , 101-114
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Solving convex programs by random walksJournal of the ACM, 2004
- A linear lower bound on the unbounded error probabilistic communication complexityJournal of Computer and System Sciences, 2002
- Perceptron, Winnow, and PAC LearningSIAM Journal on Computing, 2002
- Interior Point Methods: Current Status and Future Directions2000
- A Polynomial-Time Algorithm for Learning Noisy Linear Threshold FunctionsAlgorithmica, 1998
- Incorporating Condition Measures into the Complexity Theory of Linear ProgrammingSIAM Journal on Optimization, 1995
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Polynomial algorithms in linear programmingUSSR Computational Mathematics and Mathematical Physics, 1980
- Utilization of the operation of space dilatation in the minimization of convex functionsCybernetics and Systems Analysis, 1972
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954