## Abstract A Monte Carlo sampling algorithm for searching a scaleβtransformed conformational energy space of polypeptides is presented. This algorithm is based on the assumption that energy barriers can be overcome by a uniform sampling of the logarithmically transformed energy space. This algorit
A Feedback Algorithm for Determining Search Parameters for Monte Carlo Optimization
β Scribed by Chris Morey; John Scales; Erik S. Van Vleck
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 242 KB
- Volume
- 146
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
β¦ Synopsis
Monte Carlo methods have become popular for obtaining solutions to global optimization problems. One such Monte Carlo optimization technique is simulated annealing (SA). Typically in SA the parameters of the search are determined a priori. Using an aggregated, or lumped, version of SA's associated Markov chain and the concept of expected hitting time, we adjust the search parameters dynamically using information gained from the SA search process. We present an algorithm that varies the SA search parameters dynamically, and show that, on average, dynamic adjustment of the parameters attains better solutions on a set of test problems than those attained with a logarithmic cooling schedule.
π SIMILAR VOLUMES
We demonstrate that the recently proposed pruned-enriched Rosenbluth method (PERM) (Grassberger, Phys. Rev. E 56:3682, 1997) leads to extremely efficient algorithms for the folding of simple model proteins. We test it on several models for lattice heteropolymers, and compare it to published Monte Ca
Many steady-state models of polymer electrolyte membrane fuel cells (PEMFC) have been developed and published in recent years. However, models which are easy to be solved and feasible for engineering applications are few. Moreover, rarely the methods for parameter optimization of PEMFC stack models