On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
- 1 May 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 3 (2), 413-422
- https://doi.org/10.1137/0803019
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear ProgrammingMathematics of Operations Research, 1993
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1992
- Homotopy Continuation Methods for Nonlinear Complementarity ProblemsMathematics of Operations Research, 1991
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Pathways to the Optimal Set in Linear ProgrammingPublished by Springer Nature ,1989
- A new continuation method for complementarity problems with uniformP-functionsMathematical Programming, 1989
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963