Consistency of a myopic Bayesian algorithm for one-dimensional global optimization
From MaRDI portal
Publication:2366971
The author formulates and analyzes a myopic algorithm for finding the maximum of an unknown function based on squared error loss. The convergence properties of the myopic algorithm are investigated. A worst- case analysis of the algorithm for Brownian motion is given.
Recommendations
- A one-dimensional optimization algorithm and its convergence rate under the Wiener measure
- Bayesian algorithms for one-dimensional global optimization
- Optimal random non-adaptive algorithm for global optimization of Brownian motion
- An adaptive stochastic global optimization algorithm for one-dimensional functions
- An adaptive univariate global optimization algorithm and its convergence rate under the Wiener measure
Cites work
- Bayesian methods in global optimization
- Global optimization
- scientific article; zbMATH DE number 3913429 (Why is no real title available?)
- scientific article; zbMATH DE number 43985 (Why is no real title available?)
- scientific article; zbMATH DE number 3538599 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3278887 (Why is no real title available?)
- On the consistency of Bayes estimates
- The joint density of the maximum and its location for a Wiener process with drift
Cited in
(3)
This page was built for publication: Consistency of a myopic Bayesian algorithm for one-dimensional global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366971)