Relative frequencies of generalized simulated annealing

Mathematics of Operations Research

Volumn 31, Issue 1, 2006, Pages 199-216

  Hannig, Jan ^a   Chong, Edwin K P ^b   Kulkarni, Sanjeev R ^c  

^a Department of Environmental and Radiological Health Sciences   (United States)

^b Engineering Research Center and Hydraulics Laboratory   (United States)

^c Princeton University   (United States)

Author keywords

Coupling; Randomized optimization; Relative frequency; Simulated annealing

Indexed keywords

COUPLING; RANDOMIZED OPTIMIZATION; RELATIVE FREQUENCY; STOCHASTIC SEARCH ALGORITHMS;

ALGORITHMIC LANGUAGES; CONVERGENCE OF NUMERICAL METHODS; MARKOV PROCESSES; OPERATIONS RESEARCH; OPTIMIZATION; RANDOM PROCESSES;

SIMULATED ANNEALING;

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

References (21)

1. Catoni, O. 1992. Rough large deviation estimates for simulated annealing: Application to exponential schedules, Ann. Probability 20(3) 1109-1146.
2. Chong, E. K. P., I.-J. Wang, S. R. Kulkarni. 1999. Noise conditions for prespecified convergence rates of stochastic approximation algorithms. IEEE Trans. Inform. Theory 45(2) 810-814.
3. Connors, D. P., P. R. Kumar. 1989. Simulated annealing type Markov chains and their order balance equations. SIAM J. Control Optim. 27(6) 1440-1461.
4. Cot, C., O. Catoni. 1998. Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms. Ann. Appl. Probability 8(2) 375-396.
5. Del Moral, P., L. Miclo. 1999. On the convergence and applications of generalized simulated annealing. SLAM J. Control Optim. 37(4) 1222-1250.
6. Durrett, R. 1996. Probability: Theory and Examples, 2nd ed. Duxbury Press, Belmont, CA.
7. Freidlin, M. I., A. D. Wentzell, 1984. Random perturbations of dynamical systems. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Vol. 260. Springer-Verlag, New York. [J. Szücs. trans.]
8. Gelfand, S. B., S. K. Mitter. 1991. Simulated annealing type algorithms for multivariate optimization. Algorithmica 6(3) 419-436.
9. Geman, S., D. Geman. 1984. Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Machine Intelligence 6 721-741.
10. Gong, W.-B., Y.-C. Ho, W. Zhai. 2000. Stochastic comparison algorithm for discrete optimization with estimation. SIAM J. Optim. 10(2) 384-404.
11. Hajek, B. 1988. Cooling schedules for optimal annealing. Math. Oper. Res. 13(2) 311-329.
12. Kirkpatrick, S., C. D. Gelatt, Jr., M. P. Vecchi. Optimization by simulated annealing. Science 220(4598) 671-680.
13. Kulkarni, S. R., C. S. Horn. 1996. An alternative proof for convergence of stochastic approximation algorithms. IEEE Trans. Automatic Control 41(3) 419-424.
14. Metropolis, N., A. W. Rosenbluth, M. N. Rosenbluth, H. Teller, E. Teller. 1953. Equation of State Calculations by Fast Computing Machines. J. Chemical Phys. 21(6) 1087-1092.
15. Trouvé, A. 1992. Convergence optimale pour les algorithmes de recuits généralisés. C. R. Acad. Sci. Paris Sér. I Math. 315(11) 1197-1202.
16. Tsallis, C., D. A. Stariolo. 1996. Generalized simulated annealing. Physica A 233(1-2) 395-106.
17. Tsitsiklis, J. N. 1989. Markov chains with rare transitions and simulated annealing. Math. Oper. Res. 14(1) 70-90.
18. Wang, I.-J., E. K. P. Chong. 1998. A deterministic analysis of stochastic approximation with randomized directions. IEEE Trans. Automat. Control 43(12) 1745-1749.
19. Wang, I.-J., E. K. P. Chong, S. R. Kulkarni. 1996. Equivalent necessary and sufficient conditions on noise sequences for stochastic approximation algorithms. Adv. Appl. Probability 28(3) 784-801.
20. Wang, I.-J., E. K. P. Chong, S. R. Kulkarni. 1997. Weighted averaging and stochastic approximation. Math. Control Signals Systems 10(1) 41-60.
21. Yan, D., H. Mukai. 1992. Stochastic discrete optimization. SIAM J. Control Optim. 30(3) 594-612.