Finding the minimum of a function
From MaRDI portal
The authors study adaptive query algorithms for finding the minimum of a function \(f\). The rate of convergence of these algorithms is estimated under various model assumptions on the function \(f\). The second part of the paper studies adaptive algorithms for finding the minimum of a function in high dimension. A numerical example is given.
Recommendations
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
- Average performance of a class of adaptive algorithms for global optimization
- A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise
- Randomized algorithm for global optimization with bounded memory
- Convergence of adaptive algorithms of minimization under a drift of the minimum of an objective function
Cited in
(7)- Min-max functions
- Recursive estimation of a failure probability for a Lipschitz function
- Information based complexity for high dimensional sparse functions
- scientific article; zbMATH DE number 1107386 (Why is no real title available?)
- Quasi-linear compressed sensing
- Deterministic computation of quantiles in a Lipschitz framework
- Learning the maximum of a Hölder function from inexact data
This page was built for publication: Finding the minimum of a function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2511252)
