Polynomiality of infeasible-interior-point algorithms for linear programming
- 1 October 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 67 (1-3) , 109-119
- https://doi.org/10.1007/bf01582216
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Centered newton method for mathematical programmingPublished by Springer Nature ,2006
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity ProblemSIAM Journal on Optimization, 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!Interfaces, 1990
- Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 1989
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989