Recent progress and open problems in algorithmic convex geometry

DOI10.4230/LIPICS.FSTTCS.2010.42MaRDI QIDQ2908836zbMATH OpenFDO

Authors Santosh S. Vempala

Publication date 29 August 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_9d86.html

zbMATH Keywords

algorithmsconvex geometrygeometric inequalitiesintegrationlearningoptimizationroundingsampling

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Linear programming (90C05) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 66476
• scientific article; zbMATH DE number 1066390
• scientific article; zbMATH DE number 4132269
• Concentration phenomena in high dimensional geometry
• A random polynomial-time algorithm for approximating the volume of convex bodies

Cited in

(10)

• Relaxing the Gaussian assumption in shrinkage and SURE in high dimension
• Best and random approximation of a convex body by a polytope
• Large deviations, moderate deviations, and the KLS conjecture
• Concentration phenomena in high dimensional geometry
• On approximation by projections of polytopes with few facets
• scientific article; zbMATH DE number 7626720 (Why is no real title available?)
• Centerpoints: a link between optimization and convex geometry
• Ensemble Kalman sampler: mean-field limit and convergence analysis
• scientific article; zbMATH DE number 7758320 (Why is no real title available?)
• Algorithmic complexity of a problem of idempotent convex geometry.

This page was built for publication: Recent progress and open problems in algorithmic convex geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908836)