Adaptive search with stochastic acceptance probabilities for global optimization
β Scribed by Archis Ghate; Robert L. Smith
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 354 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we estabfish some bounds for the probability that simulated annealing produces an optimal or near-optlmal solution. Such bounds are giveat for both asymptotical and finite mlmher of steps in the algorithm, and they depend only on the instance of the problem to be treated. Then we comp
Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty method
## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraintβfree optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some
## Abstract Molecular dynamics and other molecular simulation methods rely on a potential energy function, based only on the relative coordinates of the atomic nuclei. Such a function, called a force field, approximately represents the electronic structure interactions of a condensed matter system.