On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids

Given A≔{a1,…,am}⊂RdA≔{a1,…,am}⊂Rd whose affine hull is RdRd, we study the problems of computing an approximate rounding of the convex hull of AA and an approximation to the minimum-volume enclosing ellipsoid of AA. In the case of centrally symmetric sets, we first establish that Khachiyan's barycentric coordinate descent (BCD) method is exactly the polar of the deepest cut ellipsoid method using two-sided symmetric cuts. This observation gives further insight into the efficient implementation of the BCD method. We then propose a variant algorithm which computes an approximate rounding of the convex hull of AA, and which can also be used to compute an approximation to the minimum-volume enclosing ellipsoid of AA. Our algorithm is a modification of the algorithm of Kumar and Yıldırım, which combines Khachiyan's BCD method with a simple initialization scheme to achieve a slightly improved polynomial complexity result, and which returns a small “core set.” We establish that our algorithm computes an approximate solution to the dual optimization formulation of the minimum-volume enclosing ellipsoid problem that satisfies a more complete set of approximate optimality conditions than either of the two previous algorithms. Furthermore, this added benefit is achieved without any increase in the improved asymptotic complexity bound of the algorithm of Kumar and Yıldırım or any increase in the bound on the size of the computed core set. In addition, the “dropping idea” used in our algorithm has the potential of computing smaller core sets in practice. We also discuss several possible variants of this dropping technique.