A polynomial method of approximate centers for linear programming
- 1 February 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 54 (1) , 295-305
- https://doi.org/10.1007/bf01586056
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Long steps in an O(n 3 L) algorithm for linear programmingMathematical Programming, 1992
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential functionMathematical Programming, 1991
- Polynomial affine algorithms for linear programmingMathematical Programming, 1990
- An O(n 3 L) primal interior point algorithm for convex quadratic programmingMathematical Programming, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A monotonic projective algorithm for fractional linear programmingAlgorithmica, 1986
- A polynomial newton method for linear programmingAlgorithmica, 1986
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984