Abstract
We describe a class of adaptive algorithms for approximating the global minimum of a function defined on a compact subset of Rd. The algorithms are adaptive versions of Monte Carlo search and use a memory of a fixed number of past observations. By choosing a large enough memory, the convergence rate can be made to exceed any power of the convergence rate obtained with standard Monte Carlo search.
Original language | English (US) |
---|---|
Pages (from-to) | 1068-1081 |
Number of pages | 14 |
Journal | Mathematics and Computers in Simulation |
Volume | 80 |
Issue number | 6 |
DOIs | |
State | Published - Feb 2010 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science
- Numerical Analysis
- Modeling and Simulation
- Applied Mathematics
Keywords
- Global optimization
- Monte Carlo methods
- Parallel algorithm
- Point process
- Randomized algorithm