Rank-two update algorithms for the minimum volume enclosing ellipsoid problem

Abstract

We consider the problem of computing a (1+?)-approximation to the minimum volume enclosing ellipsoid (MVEE) of a given set of m points in R n . Based on the idea of sequential minimal optimization (SMO) method, we develop a rank-two update algorithm. This algorithm computes an approximate solution to the dual optimization formulation of the MVEE problem, which updates only two weights of the dual variable at each iteration. We establish that this algorithm computes a (1+?)-approximation to MVEE in O(mn 3/?) operations and returns a core set of size O(n 2/?) for ??(0,1). In addition, we give an extension of this rank-two update algorithm. Computational experiments show the proposed algorithms are very efficient for solving large-scale problem with a high accuracy.