Superlinear convergence of infeasible-interior-point methods for linear programming
- 1 August 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 66 (1) , 361-377
- https://doi.org/10.1007/bf01581155
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity ProblemSIAM Journal on Optimization, 1994
- A primal—dual infeasible-interior-point algorithm for linear programmingMathematical Programming, 1993
- A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1993
- On the Implementation of a Primal-Dual Interior Point MethodSIAM Journal on Optimization, 1992
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear ProgrammingSIAM Journal on Optimization, 1992
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- Error bounds for nondegenerate monotone linear complementarity problemsMathematical Programming, 1990
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- A Primal-Dual Interior Point Algorithm for Linear ProgrammingPublished by Springer Nature ,1989
- On approximate solutions of systems of linear inequalitiesJournal of Research of the National Bureau of Standards, 1952