A primal—dual infeasible-interior-point algorithm for linear programming
- 1 August 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 61 (1-3), 263-280
- https://doi.org/10.1007/bf01582151
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A little theorem of the bigℳ in interior point algorithmsMathematical Programming, 1993
- Homotopy Continuation Methods for Nonlinear Complementarity ProblemsMathematics of Operations Research, 1991
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- On some efficient interior point methods for nonlinear convex programmingLinear Algebra and its Applications, 1991
- A Unified Approach to Interior Point Algorithms for Linear Complementarity ProblemsLecture Notes in Computer Science, 1991
- Further Development of a Primal-Dual Interior Point MethodINFORMS Journal on Computing, 1990
- 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
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989