Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- 1 January 1993
- journal article
- research article
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 27 (1) , 85-103
- https://doi.org/10.1007/bf01182599
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the method of analytic centers for solving smooth convex programsPublished by Springer Nature ,2006
- On the complexity of following the central path of linear programs by linear extrapolation IIMathematical Programming, 1991
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programsApplied Mathematics & Optimization, 1990
- On the convergence behavior of trajectories for linear programmingContemporary Mathematics, 1990
- Power Series Variants of Karmarkar-Type AlgorithmsAT&T Technical Journal, 1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984