A Self-Correcting Version of Karmarkar’s Algorithm
- 1 August 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 26 (4) , 1006-1015
- https://doi.org/10.1137/0726056
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A relaxed version of Karmarkar's methodMathematical 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
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 1986
- A modification of karmarkar's linear programming algorithmAlgorithmica, 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 different convergence proof of the projective method for linear programmingOperations Research Letters, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982