Simulated annealing for convex optimization

Mathematics of Operations Research

Volumn 31, Issue 2, 2006, Pages 253-266

  Kalai, Adam Tauman ^a   Vempala, Santosh ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Convex optimization; Linear programming; MCMC; Simulated annealing

Indexed keywords

BOLTZMANN-GIBBS DISTRIBUTIONS; CONVEX OPTIMIZATION; LINEAR FUNCTIONS; MCMC;

ALGORITHMS; FUNCTION EVALUATION; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY; SIMULATED ANNEALING;

OPTIMIZATION;

EID: 33748430373     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0194     Document Type: Article

References (26)

1. Applegate, D., R. Kannan. 1990. Sampling and integration of near logconcave functions. Proc. Annual Sympos. Theory Comput., 156-163.
2. Bertsimas, D., S. Vempala. 2004. Solving convex programs by random walks. J. ACM 51 540-556.
3. Cover, T., J. Thomas. 1991. Elements of Information Theory. Wiley, New York.
4. Dinghas, A. 1957. Uber eine Klasse superadditiver Mengenfunktionale von Brunn-Minkowski-Lusternik-schem Typus. Math. Zeitschrift 68 111-125.
5. Frieze, A., R. Kannan, N. Poison. 1994. Sampling from logconcave distributions. Ann. Appl. Probab. 4 812-837. Correction: Sampling from logconcave distributions. 1994. Ann. Appl. Probab. 4 1255.
6. Gilks, W., P. Wild. 1992. Adaptive rejection sampling for Gibbs sampling. Appl. Statist. 41 337-348.
7. Grötchel, L., L. Lovász, A. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimisation. Springer-Verlag, Berlin, Germany.
8. Hajek, B. 1988. Cooling schedules for optimal annealing. Math. Oper. Res. 13 311-329.
9. Jerrum, M., G. Sorkin. 1993. Simulated annealing for graph bisection. Proc. Annual IEEE Sympos. Foundations Comput. Sci., 94-103.
10. Jerrum, M., A. Sinclair, E. Vigoda. 2001. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Proc. Annual Sympos. Theory Comput., 712-721.
11. 5) volume algorithm for convex bodies. Random Structures Algorithms 11 1-50.
12. Kirkpatrick, S., C. D. Gelatt, Jr., M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220 671-680.
13. Leindler, L. 1972. On a certain converse of Hölder's Inequality II. Acta Sci. Math. Sieged 33 217-223.
14. Lovász, L., S. Vempala. 2003. The Geometry of Logconcave Functions and Sampling Algorithms. http://math.mit.edu/~vempala/papers/logcon.pdf.
15. (Preliminary version in 2003. Proc. Annual IEEE Sympos. Foundations Comput. Sci., 650-659.)
16. Lovász, L., S. Vempala. 2006. Hit-and-run from a corner. SIAM J. Comput. 35(4) 985-1005.
17. 4) volume algorithm. J. Comput. System Sci. 72(2) 392-417.
18. Prékopa, A. 1973. Logarithmic concave measures and functions. Acta Sci. Math. Szeged 34 335-343.
19. Prékopa, A. 1973. On logarithmic concave measures with applications to stochastic programming. Acta Sci. Math. Szeged 32 301-316.
20. Press, W., B. Flannery, S. Teukolsky, W. Vetterling. 1992. Numerical Recipes in C: The Art and Science of Computing, 2nd ed. Cambridge University Press, Cambridge, UK.
21. Rudelson, M. 1999. Random vectors in the isotropic position. J. Funct. Anal 164 60-72.
22. Sorkin, G. 1991. Efficient simulated annealing on fractal energy landscapes. Algorithmica 6 367-418.
23. Spall, J. 2003. Introduction to Stochastic Search and Optimization. Wiley, New York.
24. Vempala, S. Geometric random walks: A survey. MSRI Volume on Combinatorial and Computational Geometry. http://www-math.mit.edu/~vempala/ survey.ps.
25. Zabinsky, Z. B. 2003. Stochastic Adaptive Search for Global Optimization. Kluwer Academic Publishers, Boston, MA.
26. Zabinsky, Z. B., R. L. Smith, J. F. McDonald, H. E. Romeijn, D. E. Kaufman. 1993. Improving hit-and-run for global optimization. J. Global Optim. 3 171-192.