On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- 1 June 1993
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 60 (1), 81-92
- https://doi.org/10.1007/bf01580602
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Decomposition and Nondifferentiable Optimization with the Projective AlgorithmManagement Science, 1992
- Limiting behavior of the affine scaling continuous trajectories for linear programming problemsMathematical Programming, 1991
- Cutting planes and column generation techniques with the projective algorithmJournal of Optimization Theory and Applications, 1990
- New trajectory-following polynomial-time algorithm for linear programming problemsJournal of Optimization Theory and Applications, 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
- On the convexity of the multiplicative version of Karmarkar's potential functionMathematical Programming, 1988
- A polynomial newton method for linear programmingAlgorithmica, 1986
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984