Average performance of passive algorithms for global optimization
From MaRDI portal
Publication:1804782
DOI10.1006/JMAA.1995.1151zbMATH Open0832.90103OpenAlexW2001155497MaRDI QIDQ1804782FDOQ1804782
Authors: James M. Calvin
Publication date: 15 May 1995
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1995.1151
Recommendations
- Average performance of a class of adaptive algorithms for global optimization
- Optimal random non-adaptive algorithm for global optimization of Brownian motion
- Convergence rates of efficient global optimization algorithms
- Consistency of a myopic Bayesian algorithm for one-dimensional global optimization
Cited In (8)
- On Lerch's transcendent and the Gaussian random walk
- Cumulants of the maximum of the Gaussian random walk
- Using excursion to analyze simulation output
- On the minimum of a conditioned Brownian bridge
- Asymptotics of the maximum of Brownian motion under Erlangian sampling
- Title not available (Why is that?)
- A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise
- On the monitoring error of the supremum of a normal jump diffusion process
This page was built for publication: Average performance of passive algorithms for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804782)