Search directions for interior linear-programming methods
- 1 June 1991
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 6 (2) , 153-181
- https://doi.org/10.1007/bf01759039
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- On the convexity of the multiplicative version of Karmarkar's potential functionMathematical Programming, 1988
- 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 multiplicative barrier function method for linear programmingAlgorithmica, 1986
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 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
- Conic Approximations and Collinear Scalings for OptimizersSIAM Journal on Numerical Analysis, 1980