Infeasible-Interior-Point Algorithms
- 1 January 1996
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear ProgrammingSIAM Journal on Optimization, 1995
- Polynomiality of infeasible-interior-point algorithms for linear programmingMathematical Programming, 1994
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the ArtINFORMS Journal on Computing, 1994
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear ProgrammingMathematics of Operations Research, 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
- 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!Informs Journal on Applied Analytics, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984