Recent Progress and Open Problems in Algorithmic Convex Geometry

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. Contents

• Type: Journal
• Year: 2010
• Where: FSTTCS
• Authors: Santosh Vempala
• Keywords: Algorithmic Convex Geometry, Concentration Inequalities, FSTTCS 2010, Several Open Problems, Software Engineering