Infeasible Interior Point Methods for Solving Linear Programs

Publisher Website

1 January 1994

book chapter
Published by Springer Nature

p. 415-434
https://doi.org/10.1007/978-94-009-0369-2_14

Abstract

No abstract available

Keywords

This publication has 8 references indexed in Scilit:

Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
Applied Mathematics & Optimization, 1993
On Anstreicher's combined phase I—phase II projective algorithm for linear programming
Mathematical Programming, 1992
Computational experience with a primal-dual interior point method for linear programming
Linear Algebra and its Applications, 1991
On the complexity of following the central path of linear programs by linear extrapolation II
Mathematical Programming, 1991
Feasibility issues in a primal-dual interior-point method for linear programming
Mathematical Programming, 1990
Interior path following primal-dual algorithms. part I: Linear programming
Mathematical Programming, 1989
A polynomial-time algorithm for a class of linear complementarity problems
Mathematical Programming, 1989
A combined phase I-phase II projective algorithm for linear programming
Mathematical Programming, 1989