A simplified global convergence proof of the affine scaling algorithm
Authors:
- 1 September 1993
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 46-47 (2) , 443-482
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Two-thirds is sharp for affine scalingOperations Research Letters, 1993
- Determining the interior point of a system of linear inequalitiesCybernetics and Systems Analysis, 1992
- Limiting behavior of the affine scaling continuous trajectories for linear programming problemsMathematical Programming, 1991
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Boundary Behavior of Interior Point Algorithms in Linear ProgrammingMathematics of Operations Research, 1989
- Computational experience with a dual affine variant of Karmarkar's method for linear programmingOperations Research Letters, 1987
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A new polynomial-time algorithm for linear programming1984
- On approximate solutions of systems of linear inequalitiesJournal of Research of the National Bureau of Standards, 1952