A near-optimal algorithm for approximating the John Ellipsoid

05/28/2019
by   Michael B. Cohen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2023

A Near-Optimal Deterministic Distributed Synchronizer

We provide the first deterministic distributed synchronizer with near-op...
research
09/07/2018

When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing

We study the problem of matching rides in a ride sharing platform. Such ...
research
09/24/2021

A Parallel Tempering Approach for Efficient Exploration of the Verification Tradespace in Engineered Systems

Verification is a critical process in the development of engineered syst...
research
11/02/2020

Complexity of near-optimal robust versions of multilevel optimization problems

Near-optimality robustness extends multilevel optimization with a limite...
research
12/22/2021

Simple and near-optimal algorithms for hidden stratification and multi-group learning

Multi-group agnostic learning is a formal learning criterion that is con...
research
03/28/2018

Prediction-Based Fast Thermoelectric Generator Reconfiguration for Energy Harvesting from Vehicle Radiators

Thermoelectric generation (TEG) has increasingly drawn attention for bei...
research
06/27/2018

Implementation of a Near-Optimal Complex Root Clustering Algorithm

We describe Ccluster, a software for computing natural ϵ-clusters of com...

Please sign up or login with your details

Forgot password? Click here to reset