On Numerical Solution of the Maximum Volume Ellipsoid Problem
In this paper we study practical solution methods for finding the maximum-volume ellipsoid inscribing a given full-dimensional polytope in R n defined by a finite set of affine inequalities. Our goal is to design a general-purpose algorithmic framework that is reliable and efficient in practice. To evaluate the merit of a practical algorithm, we consider two key factors: the computational cost per iteration and the typical number of iterations required for convergence. In addition, numerical stability is also an important factor. We investigate some new formulations upon which we build primal-dual type, interior-point algorithms, and provide theoretical justifications for the proposed formulations and algorithmic framework. Extensive numerical experiments have shown that one of the new algorithms should be the method of choice among the tested algorithms.
Citable link to this pagehttps://hdl.handle.net/1911/101977
MetadataShow full item record
- CAAM Technical Reports