Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- 1 February 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 5 (1) , 52-67
- https://doi.org/10.1137/0805003
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Global convergence in infeasible-interior-point algorithmsMathematical Programming, 1994
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goalsLinear Algebra and its Applications, 1993
- A primal—dual infeasible-interior-point algorithm for linear programmingMathematical Programming, 1993
- 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
- Feasibility issues in a primal-dual interior-point method for linear programmingMathematical Programming, 1990
- Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick!Interfaces, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A Primal-Dual Interior Point Algorithm for Linear ProgrammingPublished by Springer Nature ,1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984