摘要: Abstract Simulated annealing is a stochastic strategy for searching the ground state. A fast simulated (FSA) semi-local search and consists of occasional long jumps. The cooling schedule FSA algorithm inversely linear in time which compared with classical (CSA) strictly local requires to be proportional logarithmic function time. general D-dimensional Cauchy probability generating state given. Proofs both CSA are sketched. double potential well used numerically illustrate schemes.
harvard.edu
elsevier.com
sci-hub.se 参考文章(5)
H.H. Szu, R.L. Hartley, Nonconvex optimization by fast simulated annealing Proceedings of the IEEE. ,vol. 75, pp. 1538- 1540 ,(1987) , 10.1109/PROC.1987.13916
Stuart Geman, Donald Geman, Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-6, pp. 721- 741 ,(1984) , 10.1109/TPAMI.1984.4767596
S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by Simulated Annealing Science. ,vol. 220, pp. 671- 680 ,(1983) , 10.1126/SCIENCE.220.4598.671
Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, Edward Teller, Equation of State Calculations by Fast Computing Machines The Journal of Chemical Physics. ,vol. 21, pp. 1087- 1092 ,(1953) , 10.1063/1.1699114
D. CEPERLEY, B. ALDER, Quantum monte carlo. Science. ,vol. 231, pp. 555- 560 ,(1986) , 10.1126/SCIENCE.231.4738.555