Large step volumetric potential reduction algorithms for linear programming
Author:
- 1 December 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 62 (1) , 521-538
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Interior-Point Polynomial Algorithms in Convex Programming1994
- A Technique for Bounding the Number of Iterations in Path Following Algorithms1993
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential functionMathematical Programming, 1991
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction MethodSIAM Journal on Optimization, 1991
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function MethodSIAM Journal on Optimization, 1991
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- Polynomial affine algorithms for linear programmingMathematical Programming, 1990
- A new algorithm for minimizing convex functions over convex sets1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- Matrix Analysis1985