Hybrid parallel tempering and simulated annealing method

Applied Mathematics and Computation

Volumn 212, Issue 1, 2009, Pages 216-228

  Li, Yaohang ^a   Protopopescu, Vladimir A ^b   Arnold, Nikita ^c   Zhang, Xinyu ^d   Gorin, Andrey ^b  

^a North Carolina Agricultural and Technical State University   (United States)

^b OAK RIDGE NATIONAL LABORATORY   (United States)

^c JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^d State University   (United States)

Author keywords

Markov chain Monte Carlo; Parallel tempering; Simulated annealing

Indexed keywords

COMPOSITE SYSTEMS; COOLING SCHEMES; EFFICIENT SAMPLINGS; EXPECTED IMPROVEMENTS; HIGH-DIMENSIONAL; HYBRID SCHEMES; INITIAL VALUES; LADDER CONFIGURATIONS; LOCAL MINIMUMS; MARKOV CHAIN MONTE CARLO; MULTIPLE CONFORMATIONS; OBJECTIVE FUNCTIONS; PARALLEL TEMPERING; PARALLELIZATION POTENTIALS; PROCESS USE; SIMULATED ANNEALING METHODS; STEP SIZES; TARGET TEMPERATURES; TEMPERATURE VALUES; WAITING-TIME;

ANNEALING; CONVERGENCE OF NUMERICAL METHODS; COOLING; LADDERS; LARGE SCALE SYSTEMS; MARKOV PROCESSES; MONTE CARLO METHODS; PHOTOTRANSISTORS; TEMPERING; TRAVELING SALESMAN PROBLEM; UNCERTAIN SYSTEMS;

SIMULATED ANNEALING;

EID: 67349202839     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.02.023     Document Type: Article

References (38)

1. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., and Teller E. Equation of state calculations by fast computing machines. J. Chem. Phys. 21 (1953) 1087-1092
2. Hastings W.K. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57 (1970) 97-109
3. Wong W.H., and Liang F. Dynamic weighting in Monte Carlo and optimization. Proc. Natl. Acad. Sci. USA 94 (1997) 14220-14224
4. Kirkpatrick S., Gelatt Jr. C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
5. Marinari E., and Parisi G. Simulated tempering: a new Monte Carlo scheme. Europhys. Lett. 19 (1992) 451-458
6. Geyer C.J., and Thompson E.A. Annealing Markov chain Monte Carlo with applications to ancestral inference. J. Am. Stat. Assoc. 90 (1995) 909-920
7. Liu J.S., Liang F., and Wong W.H. A theory for dynamic weighting in Monte Carlo computation. J. Am. Stat. Assoc. 96 (2001) 561-573
8. Brown S., and Head-Gordon T. Cool walking: a new Markov chain Monte Carlo sampling method. J. Comput. Chem 24 (2003) 68-76
9. 8 clusters. J. Chem. Phys. 99 9 (1993) 6957-6970
10. Zhou R., and Berne B.J. Smart walking: a new method for Boltzmann sampling of protein conformations. J. Chem. Phys. 107 21 (1996) 9185-9196
11. Moreno J.J., Katzgraber H.G., and Hartmann A.K. Finding low-temperature states with parallel tempering, simulated annealing and simple Monte Carlo. Int. J. Mod. Phys. C 14 3 (2003) 285-299
12. J.S. Liu, Markov Chain Monte Carlo and Related Topics, Technical Report, Stanford University, 1999.
13. Hansmann U. Parallel tempering algorithm for conformational studies of biological molecules. Chem. Phys. Lett. 281 (1997) 140-150
14. Katzgraber H.G., Palassini M., and Young A.P. Monte Carlo simulation of spin glasses at low temperatures. Phys. Rev. B 63 (2001) 184422
15. Ballesteros H.G., Cruz A., Fernandez L.A., Martin-Mayor V., Pech J., Ruiz-Lorenzo J.J., Tarancon A., Tellez P., Ullod C.L., and Ungil C. Critical behavior of the three-dimensionalising spin glass. Phys. Rev. B 62 21 (2000) 14237-14245
16. Hukushima K., and Nemoto K. Exchange Monte Carlo method and application to spin glass simulations. J. Phys. Soc. (JPN) 65 (1996) 1604-1608
17. Falcioni M., and Deem M.W. A biased Monte Carlo scheme for zeolite structure solution. J. Chem. Phys. 110 (1999) 1754-1766
18. Schug A., Herges T., Verma A., and Wenzel W. Investigation of the parallel tempering method for protein folding. J. Phys: Condens. Matter 17 (2005) 1641-1650
19. Schug A., and Wenzel W. Predictive in silico all atom folding of a four helix protein with a free energy model. J. Am. Chem. Soc. 126 (2004) 16737
20. Nourani Y., and Andresen B. A comparison of simulated annealing cooling strategies. J. Phys. A: Math. Gen. 31 (1998) 8373-8385
21. Berg B.A. Markov Chain Monte Carlo Simulations and Their Statistical Analysis (2004), World Scientific p. 197
22. Knuth D.E. The Art of Computer Programming. third ed. (1997), Addison-Wesley Publishing Company
23. Li Y., Protopopescu V.A., and Gorin A. Accelerated simulated tempering. Phys. Lett. A 328 4 (2004) 274-283
24. Rathore N., Chopra M., and de Pablo J.J. Optimal allocation of replicas in parallel tempering simulations. J. Chem. Phys. 122 2 (2005) 024111
25. Kone A., and Kofke D.A. Selection of temperature intervals for parallel tempering simulations. J. Chem. Phys. 122 20 (2005) 206101
26. Katzgraber H.G., Trebst S., Huse D.A., and Troyer M. Feedback-optimized parallel tempering Monte Carlo. J. Stat. Mech.: Theor. Exp. (2006) P03018
27. Schug A., and Wenzel W. All-atom folding of the trp-cage protein with an adaptive parallel tempering method. Europhys. Lett. 67 2 (2004) 307-313
28. Baker D. A surprising simplicity to protein folding. Nature 405 (2000) 39-42
29. Brooks C.L., Gruebele M., Onuchic J.N., and Wolynes P.G. Chemical physics of protein folding. Proc. Natl. Acad. Sci. USA 95 19 (1998) 11037-11038
30. Onuchic J.N. Contacting the protein folding funnel with NMR. Proc. Natl. Acad. Sci. USA 94 (1997) 7129-7131
31. Junger M., Reinelt G., and Rinaldi G. The Traveling Salesman Problem: A Bibliography, Annotated Bibliography in Combinatorial Optimization (1997), Wiley
32. Press W.H., Teukolsky S.A., Vetterling W.T., and Flannery B.P. Numerical Recipes in C++: The Art of Scientific Computing (2002), Cambridge University Press
33. Lin S., and Kernighan B.W. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21 (1973) 498-516
34. Baraglia R., Hidalgo H.I., and Perego R. A hybrid heuristic for the traveling salesman problem. IEEE Trans. Evol. Comput. 5 6 (2001) 613-622
35. Unger R., and Moult J. Genetic algorithm for protein folding simulation. J. Mol. Biol. 231 1 (1993) 75-81
36. Storn R., and Price K. Differential evolution: a simple and efficient adaptive scheme for global optimization over continuous spaces. J. Global Optim. 11 (1997) 341-359
37. Ortiz-Boyer D., Hervas-Martinez C., and Garcia-Pedrajas N. CIXL2: a crossover operator for evolutionary algorithms based on population features. J. Artif. Intell. Res. 24 (2005) 1-48
38. Ter Braak C.J.F. A Markov chain Monte Carlo version of the genetic algorithm differential evolution: easy Bayesian computing for real parameter spaces. Stat. Comput. 16 (2006) 239-249