Average performance of passive algorithms for global optimization
From MaRDI portal
Publication:1804782
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
- Asymptotics of the maximum of Brownian motion under Erlangian sampling
- On the monitoring error of the supremum of a normal jump diffusion process
- Cumulants of the maximum of the Gaussian random walk
- Using excursion to analyze simulation output
- A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise
- scientific article; zbMATH DE number 1368022 (Why is no real title available?)
- On the minimum of a conditioned Brownian bridge
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)