Return to search

Summary Conclusions: Computation of Minimum Volume Covering Ellipsoids*

We present a practical algorithm for computing the minimum volume n-dimensional ellipsoid that must contain m given points a₁,..., am ∈ Rn. This convex constrained problem arises in a variety of applied computational settings, particularly in data mining and robust statistics. Its structure makes it particularly amenable to solution by interior-point methods, and it has been the subject of much theoretical complexity analysis. Here we focus on computation. We present a combined interior-point and active-set method for solving this problem. Our computational results demonstrate that our method solves very large problem instances (m = 30,000 and n = 30) to a high degree of accuracy in under 30 seconds on a personal computer. / Singapore-MIT Alliance (SMA)

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/3896
Date01 1900
CreatorsSun, Peng, Freund, Robert M.
Source SetsM.I.T. Theses and Dissertation
Languageen_US
Detected LanguageEnglish
TypeArticle
Format192207 bytes, application/pdf
RelationHigh Performance Computation for Engineered Systems (HPCES);

Page generated in 0.002 seconds