Show simple item record

dc.contributor.authorAhipasaoglu, S. Damla
dc.contributor.authorTodd, Michael J.
dc.date.accessioned2009-04-16T17:23:47Z
dc.date.available2009-04-16T17:23:47Z
dc.date.issued2009-04-16T17:23:47Z
dc.identifier.urihttps://hdl.handle.net/1813/12244
dc.description.abstractWe study a first-order method to find the minimum cross-sectional area ellipsoidal cylinder containing a finite set of points. This problem arises in optimal design in statistics when one is interested in a subset of the parameters. We provide convex formulations of this problem and its dual, and analyze a method based on the Frank-Wolfe algorithm for their solution. Under suitable conditions on the behavior of the method, we establish global and local convergence properties. However, difficulties may arise when a certain submatrix loses rank, and we describe a technique for dealing with this situation.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseries1472en_US
dc.subjectLinear convergenceen_US
dc.subjectFrank-Wolfe algorithmen_US
dc.subjectminimum-volume ellipsoidsen_US
dc.subjectminimum-volume cylindersen_US
dc.titleA Modified Frank-Wolfe Alogorithm for Computing Minimum-Area Enclosing Ellipsoidal Cylinders: Theory and Algorithmsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics