Karmarkar's linear programming algorithm and Newton's method
- 1 March 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 50 (1-3) , 291-330
- https://doi.org/10.1007/bf01594941
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An analog of Karmarkar's algorithm for inequality constrained linear programs, with a ‘new’ class of projective transformations for centering a polytopeOperations Research Letters, 1988
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A monotonic projective algorithm for fractional linear programmingAlgorithmica, 1986
- A multiplicative barrier function 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
- Conic Approximations and Collinear Scalings for OptimizersSIAM Journal on Numerical Analysis, 1980
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- A convergent process of price adjustment and global newton methodsJournal of Mathematical Economics, 1976