A little theorem of the bigℳ in interior point algorithms
- 1 March 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 59 (1), 361-375
- https://doi.org/10.1007/bf01581253
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Theoretical convergence of large-step primal—dual interior point algorithms for linear programmingMathematical Programming, 1993
- An interior point potential reduction algorithm for the linear complementarity problemMathematical Programming, 1992
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programmingLinear Algebra and its Applications, 1991
- 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
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A combined phase I-phase II projective algorithm for linear programmingMathematical Programming, 1989
- A polynomial newton method for linear programmingAlgorithmica, 1986
- The nonlinear complementarity problem with applications, part 1Journal of Optimization Theory and Applications, 1969