Finding Minimum-Size Ellipsoids Covering a Subset of Points: Several Simple Heuristic Approaches

摘要

We propose several heuristic methods for finding an approximate solution to the following inherently combinatorial problem: Given N points in ℝ^{n, construct the minimum- size ellipsoid covering exactly N − k of them, where k ≪ N. Various assumptions on the nature of the points and their amount are considered; the results of numerical experiments with the algorithms are discussed.}