Containing and shrinking ellipsoids in the path-following algorithm
Authors:
- 1 May 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 47 (1-3) , 1-9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear ProgrammingMathematics of Operations Research, 1990
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operationsMathematical Programming, 1990
- Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Conical projection algorithms for linear programmingMathematical Programming, 1989
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming AlgorithmMathematics of Operations Research, 1988
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- The Ellipsoid Method Generates Dual VariablesMathematics of Operations Research, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968