Adaptive optimization of the Monte-Carlo method
β Scribed by A. N. Nakonechnyi; V. D. Shpak
- Publisher
- Springer US
- Year
- 1994
- Tongue
- English
- Weight
- 346 KB
- Volume
- 30
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Quasi-Monte Carlo random search is useful in nondifferentiable optimization. Borrowing ideas of population evolution from genetic algorithms, we introduce an adaptive random search in quasi-Monte Carlo methods (AQMC) for global optimization. Adaptive technique is used such that local search can
We introduce error weighting functions into the perturbative Monte Carlo method for use with a hybrid ab initio quantum Ε½ . mechanicsrmolecular mechanics QMrMM potential. The perturbative Monte Carlo approach introduced earlier provides a means to reduce the number of full SCF calculations in simula
Monte Carlo methods, in particular Markov chain Monte Carlo methods, have become increasingly important as a tool for practical Bayesian inference in recent years. A wide range of algorithms is available, and choosing an algorithm that will work well on a speci"c problem is challenging. It is theref