On the complexity of following the central path of linear programs by linear extrapolation II
- 1 May 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 52 (1-3), 527-553
- https://doi.org/10.1007/bf01582904
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A polynomial method of approximate centers for linear programmingMathematical Programming, 1992
- Integrability of vector and multivector fields associated with interior point methods for linear programmingMathematical Programming, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programsApplied Mathematics & Optimization, 1990
- Algorithmic Enhancements to the Method of Centers for Linear Programming ProblemsINFORMS Journal on Computing, 1989
- Primal barrier methods for linear programmming: Technical reportPublished by Office of Scientific and Technical Information (OSTI) ,1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivativesAnalysis Mathematica, 1984