On the Number of Iterations of Piyavskii's Global Optimization Algorithm
From MaRDI portal
Recommendations
Cited in
(14)- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- Extension of Piyavskii's algorithm to continuous global optimization
- On using estimates of Lipschitz constants in global optimization
- Global optimization of Hölder functions
- A naive multi-scale search algorithm for global optimization problems
- Optimally adaptive integration of univariate Lipschitz functions
- The iterative algorithm of global maximum of \(\sum\cos^{2n+1}A\)
- scientific article; zbMATH DE number 556481 (Why is no real title available?)
- Derivative-free optimization methods
- MSO: a framework for bound-constrained black-box global optimization algorithms
- OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE
- Certified multifidelity zeroth-order optimization
- Statistical complexity and optimal algorithms for nonlinear ridge bandits
This page was built for publication: On the Number of Iterations of Piyavskii's Global Optimization Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978619)