Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
- 1 May 1992
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 73 (2) , 229-242
- https://doi.org/10.1007/bf00940179
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear ProgrammingPublished by Defense Technical Information Center (DTIC) ,1991
- On the Superlinear Convergence of Interior Point Algorithms for a General Class of ProblemsPublished by Defense Technical Information Center (DTIC) ,1991
- A Quadratically Convergent O(square root of nL-Iteration Algorithm for Linear ProgrammingPublished 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
- A Centered Projective Algorithm for Linear ProgrammingMathematics of Operations Research, 1990
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989