Computational experience with a globally convergent primal—dual predictor—corrector algorithm for linear programming
- 1 August 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 66 (1) , 123-135
- https://doi.org/10.1007/bf01581140
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic ObjectivesSIAM Journal on Optimization, 1993
- A primal—dual infeasible-interior-point algorithm for linear programmingMathematical Programming, 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
- A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start”Mathematical Programming, 1991
- Pathways to the Optimal Set in Linear ProgrammingPublished by Springer Nature ,1989