Abstract
This paper is concerned with the analysis of the average error in approximating the global minimum of a 1-dimensional, time-homogeneous diffusion by non-adaptive methods. We derive the limiting distribution of the suitably normalized approximation error for both random and deterministic non-adaptive approximation methods. We identify the form of the asymptotically optimal random non-adaptive approximation methods.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 343-365 |
| Number of pages | 23 |
| Journal | Communications in Statistics, Stochastic Models |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1996 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
Keywords
- Average-case complexity
- Diffusion processes
- Global optimization
Fingerprint
Dive into the research topics of 'Complexity of non-adaptive optimization algorithms for a class of diffusions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver