A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- 1 August 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 61 (1) , 39-52
- https://doi.org/10.1007/bf01582137
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 1989
- A randomized algorithm for fixed-dimensional linear programmingMathematical Programming, 1989
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- A Las Vegas algorithm for linear programming when the dimension is smallPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Constrained Global Optimization: Algorithms and ApplicationsPublished by Springer Nature ,1987
- Introduction: New approaches to linear programmingAlgorithmica, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Convexity and Optimization in Finite Dimensions IPublished by Springer Nature ,1970