A class of rank-two ellipsoid algorithms for convex programming
- 1 June 1984
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 29 (2) , 187-202
- https://doi.org/10.1007/bf02592220
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An ellipsoid algorithm for nonlinear programmingMathematical Programming, 1983
- Modifications and implementation of the ellipsoid algorithm for linear programmingMathematical Programming, 1982
- On Minimum Volume Ellipsoids Containing Part of a Given EllipsoidMathematics of Operations Research, 1982
- Feature Article—The Ellipsoid Method: A SurveyOperations Research, 1981
- Family of algorithms for solving convex programming problemsCybernetics and Systems Analysis, 1980
- Cut-off method with space extension in convex programming problemsCybernetics and Systems Analysis, 1977
- Non-Linear Programming Via Penalty FunctionsManagement Science, 1967