Solving convex programs by random walks

Convex Bodies: The Brunn–Minkowski Theory

1993 • 3,626 citations

Geometric Algorithms and Combinatorial Optimization

1988 • 3,622 citations

Introduction to linear optimization

1997 • 2,832 citations

Polynomial algorithms in linear programming

1980 • 2,063 citations

The ellipsoid method and its consequences in combinatorial optimization

1981 • 2,062 citations

The Brunn-Minkowski inequality

2002 • 924 citations

A random polynomial-time algorithm for approximating the volume of convex bodies

1991 • 714 citations

Random walks in a convex body and an improved volume algorithm

1993 • 424 citations

Isoperimetric problems for convex bodies and a localization lemma

1995 • 409 citations

Random Vectors in the Isotropic Position

1999 • 401 citations

Random walks and anO*(n5) volume algorithm for convex bodies

1997 • 303 citations

Hit-and-run mixes fast

1999 • 249 citations

Partitions of mass-distributions and of convex bodies by hyperplanes

1960 • 200 citations

On Linear Characterizations of Combinatorial Optimization Problems

1982 • 160 citations

A new algorithm for minimizing convex functions over convex sets

1996 • 151 citations

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

2001 • 114 citations

Efficient algorithms for universal portfolios

2003 • 110 citations

Faster mixing via average conductance

1999 • 97 citations

Efficient algorithms for universal portfolios

2002 • 64 citations

A Randomized Algorithm to Optimize Over Certain Convex Sets

1995 • 13 citations