Recent Progress and Open Problems in Algorithmic Convex Geometry
Santosh Vempala · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2010
This article is a survey of developments in algorithmic convex geometry over the past decade. These include algorithms for sampling, optimization, integration, rounding and learning, as well as mathematical tools such as isoperimetric and concentration inequalities. Several open problems and conjectures are discussed on the way.