MINIMUM-VOLUME ELLIPSOIDS: THEORY AND ALGORITHMS

This book, the first on these topics, addresses the problem of finding an ellipsoid to represent a large set of points in high-dimensional space, which has applications in computational geometry, data representations, and optimal design in statistics. The book covers the formulation of this and related problems, theoretical properties of their optimal solutions, and algorithms for their solution. Due to the high dimensionality of these problems, first-order methods that require minimal computational work at each iteration are attractive. While algorithms of this kind have been discovered and rediscovered over the past fifty years, their computational complexities and convergence rates have only recently been investigated. The optimization problems in the book have the entries of a symmetric matrix as their variables, so the author’s treatment also gives an introduction to recent work in matrix optimization.

This book

provides historical perspective on the problems studied by optimizers, statisticians, and geometric functional analysts;
demonstrates the huge computational savings possible by exploiting simple updates for the determinant and the inverse after a rank-one update, and highlights the difficulties in algorithms when related problems are studied that do not allow simple updates at each iteration; and
gives rigorous analyses of the proposed algorithms, MATLAB codes, and computational results.