Simulated annealing in convex bodies and an O*(n4) volume algorithm

Journal of Computer and System Sciences

Volumn 72, Issue 2, 2006, Pages 392-417

  Lovász, László ^a   Vempala, Santosh ^b  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Convex bodies; Logconcave functions; Random walks; Simulated annealing; Volume computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; SIMULATED ANNEALING; VOLUME MEASUREMENT;

CONVEX BODIES; LOGCONCAVE FUNCTIONS; RANDOM WALKS; VOLUME COMPUTATION;

ALGORITHMS;

EID: 32844462374     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.08.004     Document Type: Article

References (23)

1. D. Applegate, and R. Kannan Sampling and integration of near log-concave functions Proceedings of the 23th ACM STOC 1990 156 163
2. I. Bárány, and Z. Füredi Computing the volume is difficult Discrete Comput. Geom. 2 1987 319 326
3. D. Bertsimas, and S. Vempala Solving convex programs by random walks J. ACM 51 4 2004 540 556
4. A. Dinghas Über eine Klasse superadditiver Mengenfunktionale von Brunn-Minkowski-Lusternik-schem Typus Math. Z. 68 1957 111 125
5. M. Dyer, and A. Frieze Computing the volume of convex bodies: a case where randomness provably helps Proceedings of the AMS Symposium on Probabilistic Combinatorics and Its Applications 1991 123 170
6. M. Dyer, A. Frieze, and R. Kannan A random polynomial-time algorithm for approximating the volume of convex bodies J. Assoc. Comput. Mach. 38 1991 1 17
7. G. Elekes A geometric inequality and the complexity of computing volume Discrete Comput. Geom. 1 1986 289 292
8. M. Grötschel, L. Lovász, and A. Schrijver Geometric Algorithms and Combinatorial Optimization 1988 Springer Berlin
9. M. Jerrum, L. Valiant, and V.V. Vazirani Random generation of combinatorial structures from a uniform distribution Theoret. Comput. Sci. 43 2-3 1986 169 188
10. R. Kannan, L. Lovász, and M. Simonovits Isoperimetric problems for convex bodies and a localization lemma J. Discrete Comput. Geom. 13 1995 541 559
11. 5 ) volume algorithm for convex bodies Random Structures and Algorithms 11 1997 1 50
12. S. Kirkpatrick, C.D. Gelatt Jr, and M.P. Vecchi Optimization by Simulated Annealing Science 220 1983 671 680
13. L. Leindler On a certain converse of Hölder's Inequality II Acta Sci. Math. Szeged 33 1972 217 223
14. L. Lovász, How to compute the volume? Jber. d. Dt. Math.-Verein, Jubiläumstagung, B.G. Teubner, Stuttgart, 1990, pp. 138-151.
15. L. Lovász, and M. Simonovits Mixing rate of Markov chains, an isoperimetric inequality, and computing the volume Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science 1990 482 491
16. L. Lovász, and M. Simonovits On the randomized complexity of volume and diameter Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science 1992 482 491
17. L. Lovász, and M. Simonovits Random walks in a convex body and an improved volume algorithm Random Structures and Algorithm 4 1993 359 412
18. L. Lovász, S. Vempala, The geometry of logconcave functions and sampling algorithms, Preliminary version in FOCS 2003, Available at: 〈http://www-math.mit.edu/~vempala/papers/logcon.ps〉
19. L. Lovász, S. Vempala, Hit-and-run from a corner, in: Proceedings of STOC, 2004, pp. 310-314;
20. SIAM J. Computing, to appear.
21. A. Prékopa On logarithmic concave measures with applications to stochastic programming Acta Sci. Math. Szeged 32 1973 301 316
22. A. Prékopa Logarithmic concave measures and functions Acta Sci. Math. Szeged 34 1973 335 343
23. M. Rudelson Random vectors in the isotropic position J. Funct. Anal. 164 1999 60 72