Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

FSTTCS
2010
Springer

favoriteEmaildiscussreport

173views Software Engineering» more FSTTCS 2010»

Recent Progress and Open Problems in Algorithmic Convex Geometry

13 years 2 months ago

Recent Progress and Open Problems in Algorithmic Convex Geometry

Download www.cc.gatech.edu

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

Santosh Vempala

Real-time Traffic

Algorithmic Convex Geometry | Concentration Inequalities | FSTTCS 2010 | Several Open Problems | Software Engineering |

claim paper

Related Content

» Algorithmic Semialgebraic Geometry and Topology Recent Progress and Open Problems

» Arrangements in Geometry Recent Advances and Challenges

» RISC for Industrial Robotics Recent Results and Open Problems

» Some recent progress in exact linear algebra and related questions

» Generalized Convexity in Multiple View Geometry

» Simple Robots with Minimal Sensing From Local Visibility to Global Geometry

» Practical Global Optimization for Multiview Geometry

» Visibility Computations From Discrete Algorithms to Real Algebraic Geometry

» How Good are Convex Hull Algorithms

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FSTTCS
Authors	Santosh Vempala

Comments (0)