A survey of search directions in interior point methods for linear programming
- 1 May 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 52 (1), 481-509
- https://doi.org/10.1007/bf01582902
Abstract
No abstract availableKeywords
This publication has 31 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
- A potential-reduction variant of Renegar's short-step path-following method for linear programmingLinear Algebra and its Applications, 1991
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithmMathematical Programming, 1990
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- 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