On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- 1 May 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 2 (2) , 304-324
- https://doi.org/10.1137/0802015
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1992
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- Further Development of a Primal-Dual Interior Point MethodINFORMS Journal on Computing, 1990
- Feasibility issues in a primal-dual interior-point method for linear programmingMathematical Programming, 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
- Pathways to the Optimal Set in Linear ProgrammingPublished by Springer Nature ,1989
- A Primal-Dual Interior Point Algorithm for Linear ProgrammingPublished by Springer Nature ,1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974