Optimal algorithms for global optimization in case of unknown Lipschitz constant
From MaRDI portal
Publication:2489149
DOI10.1016/j.jco.2005.06.006zbMath1094.65057OpenAlexW2169177835MaRDI QIDQ2489149
Publication date: 16 May 2006
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2005/143/
algorithmsnumerical exampleComplexityGlobal optimizationLipschitz functionsOptimal rate of convergence
Related Items
Local adaption for approximation and minimization of univariate functions ⋮ Measure-based diffusion grid construction and high-dimensional data discretization ⋮ The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Cites Work
- Unnamed Item
- Variational properties of averaged equations for periodic media
- Deterministic and stochastic error bounds in numerical analysis
- Lipschitzian optimization without the Lipschitz constant
- The real number model in numerical analysis
- Lower bound on complexity of optimization of continuous functions
- Approximation and optimization on the Wiener space
- The complexity of the computation of the global extremum in a class of multi-extremum problems
- Global optimization