A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming
- 1 March 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 59 (1) , 151-162
- https://doi.org/10.1007/bf01581242
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Convergence behavior of interior-point algorithmsMathematical Programming, 1993
- On the finite convergence of interior-point algorithms for linear programmingMathematical Programming, 1992
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming AlgorithmsSIAM Journal on Optimization, 1992
- Homotopy Continuation Methods for Nonlinear Complementarity ProblemsMathematics of Operations Research, 1991
- An Interior-point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity ProblemsPublished by Defense Technical Information Center (DTIC) ,1991
- A Superlinearly Convergent O(square root of nL)-Iteration Algorithm for Linear ProgrammingPublished by Defense Technical Information Center (DTIC) ,1991
- Limiting behavior of the affine scaling continuous trajectories for linear programming problemsContemporary Mathematics, 1990
- On the convergence behavior of trajectories for linear programmingContemporary Mathematics, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- On approximate solutions of systems of linear inequalitiesJournal of Research of the National Bureau of Standards, 1952