A near-optimal algorithm for approximating the John Ellipsoid
arXiv:1905.11580
Abstract
We develop a simple and efficient algorithm for approximating the John Ellipsoid of a symmetric polytope. Our algorithm is near optimal in the sense that our time complexity matches the current best verification algorithm. We also provide the MATLAB code for further research.
COLT 2019