An infeasible-interior-point algorithm using projections onto a convex set
- 1 December 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 62 (1) , 59-80
- https://doi.org/10.1007/bf02206811
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear ProgrammingMathematics of Operations Research, 1995
- 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
- A primal—dual infeasible-interior-point algorithm for linear programmingMathematical Programming, 1993
- A little theorem of the bigℳ in interior point algorithmsMathematical 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
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984