On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Authors:
- Michael J. ToddMTMichael J. Todd
- E. Alper YıldırımEYE. Alper Yıldırım
- 1 August 2007
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (13) , 1731-1744
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Rounding of Convex Sets and Efficient Gradient Methods for Linear Programming ProblemsSSRN Electronic Journal, 2004
- Improved Complexity for Maximum Volume Inscribed EllipsoidsSIAM Journal on Optimization, 2002
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three DimensionsJournal of Algorithms, 2001
- On self-concordant convex–concave functionsOptimization Methods and Software, 1999
- Minimum Covering EllipsesSIAM Journal on Scientific and Statistical Computing, 1980
- Estimation of Correlation Coefficients by Ellipsoidal TrimmingJournal of the Royal Statistical Society Series C: Applied Statistics, 1978
- A geometric approach to optimal design theoryBiometrika, 1973
- Sequences Converging to $D$-Optimal Designs of ExperimentsThe Annals of Statistics, 1973
- The Sequential Generation of $D$-Optimum Experimental DesignsThe Annals of Mathematical Statistics, 1970
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956