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

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 650-659

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

^a MICROSOFT RESEARCH   (United States)

^b MTT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; SIMULATED ANNEALING; ARTIFICIAL INTELLIGENCE; MATHEMATICAL TECHNIQUES; POLYNOMIALS; PROFESSIONAL ASPECTS; SPACE STATIONS; TEMPERATURE DISTRIBUTION;

CONVEX BODIES; MORPHING TECHNIQUE; VOLUME ALGORITHM;

ALGORITHMS;

COMPUTATIONAL MODEL; CONVEX BODY; ENGINEERING PROFESSION; MORPHING; OPTIMIZATION METHOD; SEARCH METHOD; VOLUME ALGORITHMS;

EID: 17444441724     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. D. Applegate and R. Kannan: Sampling and integration of near log-concave functions, Proc. 23th ACM STOC (1990), 156-163.
2. M. Dyer and A. Frieze: Computing the volume of convex bodies: a case where randomness provably helps. Proc. AMS Symposium on Probabilistic Combinatorics and Its Applications, (1991), 123-170.
3. 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.
4. R. Kannan, L. Lovász and M. Simonovits: Isoperimetric problems for convex bodies and a localization lemma. J. Discr. Comput. Geom. 13 (1995) 541-559.
5. 5) volume algorithm for convex bodies. Random Structures and Algorithms 11 (1997), 1-50.
6. S. Kirkpatrick, C.D. Gelatt Jr., and M.P.: Vecchi Optimization by Simulated Annealing, Science 220 (1983), 671-680.
7. L. Lovász: How to compute the volume? Jber. d. Dt. Math.-Verein, Jubiläumstagung 1990, B. G. Teubner, Stuttgart, 138-151.
8. L. Lovász and M. Simonovits: Mixing rate of Markov chains, an isoperimetric inequality, and computing the volume, Proc. 31st IEEE Annual Symp. on Found. of Comp. Sci. (1990), 482-491.
9. L. Lovász and M. Simonovits: On the randomized complexity of volume and diameter, Proc. 33rd IEEE Annual Symp. on Found. of Comp. Sci. (1992), 482-291.
10. L. Lovász and M. Simonovits: Random walks in a convex body and an improved volume algorithm, Random Structures and Alg. 4 (1993), 359-412.
11. 3) sampling algorithm, Microsoft Research Tech. Rep. MSR-TR-2003-04. Available at: http://www-math.mit.edu/~vempala/papers.logcon-ball.ps
12. L. Lovász and S. Vempala: Hit-and-run is fast and fun, Microsoft Research Tech. Rep. MSR-TR-2003-05. Available at http://www-math.mit.edu/~vempala/papers/logcon-hitrun.ps
13. L. Lovász and S. Vempala: Where to start a geometric random walk, Microsoft Research Tech. Rep. MSR-TR-2003-29. Available at http://www-math.mit.edu/~vempala/papers/start.ps
14. M. Rudelson: Random vectors in the isotropic position, J. Funct. Anal. 164 (1999), 60-72.