# Faster polytope rounding, sampling, and volume computation via a sublinear "Ball Walk"

5 May 2019

We study the problem of "isotropically rounding" a polytope $K\subset\mathbb{R}^n$, that is, computing a linear transformation which makes the uniform distribution on the polytope have roughly identity covariance matrix. We assume $K$ is defined by $m$ linear inequalities, with guarantee that $rB\subset K\subset RB$, where $B$ is the unit ball... (read more)

PDF Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now