Recent Progress and Open Problems in Algorithmic Convex Geometry

Author Santosh S. Vempala

Thumbnail PDF


  • Filesize: 0.52 MB
  • 23 pages

Document Identifiers

Author Details

Santosh S. Vempala

Cite AsGet BibTex

Santosh S. Vempala. Recent Progress and Open Problems in Algorithmic Convex Geometry. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 42-64, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (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.
  • convex geometry
  • geometric inequalities
  • algorithms
  • sampling
  • optimization
  • integration
  • rounding
  • learning


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail