A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
This work proves nearly quadratic lower bounds for randomized algorithms for linear optimization and uniform sampling over convex bodies in the membership oracle model and implies the same lower bound for volume estimation.