Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming: An Ellipsoid Contains a Compact Convex Full-Dimensional Set iff a Copositive and an LMI Condition HoldResearch Paper
The minimum volume ellipsoid problem asks, for a set , for the ellipsoid of least volume that contains . This ellipsoid, the outer Löwner–John ellipsoid, is used to summarize uncertainty sets in robust optimization, to bound reachable sets in control, to build outlier-robust estimators in statistics, and as the…