文章基本信息

标题：Recent Progress and Open Problems in Algorithmic Convex Geometry
本地全文：下载
作者：Santosh S. Vempala
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2010
卷号：8
页码：42-64
DOI：10.4230/LIPIcs.FSTTCS.2010.42
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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