Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3896
Full metadata record
DC FieldValueLanguage
dc.creatorSun, Peng-
dc.creatorFreund, Robert M.-
dc.date2003-12-14T23:22:42Z-
dc.date2003-12-14T23:22:42Z-
dc.date2004-01-
dc.date.accessioned2013-10-09T02:33:00Z-
dc.date.available2013-10-09T02:33:00Z-
dc.date.issued2013-10-09-
dc.identifierhttp://hdl.handle.net/1721.1/3896-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionWe 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.-
dc.descriptionSingapore-MIT Alliance (SMA)-
dc.format192207 bytes-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationHigh Performance Computation for Engineered Systems (HPCES);-
dc.subjectellipsoid-
dc.subjectNewton’s method-
dc.subjectinterior-point method-
dc.subjectbarrier method-
dc.subjectactive set-
dc.subjectsemidefinite program-
dc.subjectdata mining-
dc.subjectrobust statistics-
dc.subjectclustering analysis-
dc.titleSummary Conclusions: Computation of Minimum Volume Covering Ellipsoids*-
dc.typeArticle-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.