2000 character limit reached
A near-optimal algorithm for approximating the John Ellipsoid
Published 28 May 2019 in cs.DS | (1905.11580v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.