A near-optimal algorithm for approximating the John Ellipsoid
Data Structures and Algorithms
2020-02-19 v2
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.
Keywords
Cite
@article{arxiv.1905.11580,
title = {A near-optimal algorithm for approximating the John Ellipsoid},
author = {Michael B. Cohen and Ben Cousins and Yin Tat Lee and Xin Yang},
journal= {arXiv preprint arXiv:1905.11580},
year = {2020}
}
Comments
COLT 2019