Asymptotic behaviour of Karmarkar's method for linear programming
- 1 January 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 46 (1) , 173-190
- https://doi.org/10.1007/bf01585736
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective valueMathematical Programming, 1988
- Convergence results and numerical experiments on a linear programming hybrid algorithmEuropean Journal of Operational Research, 1987
- A variable-metric variant of the Karmarkar algorithm for linear programmingMathematical Programming, 1987
- The iterative step in the linear programming algorithm of N. KarmarkarAlgorithmica, 1986
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 1986
- Introduction: New approaches to 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
- Intelligent gradient search in linear programmingEuropean Journal of Operational Research, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984