Noisy optimization complexity under locality assumption

DOI10.1145/2460239.2460256zbMath1369.65079OpenAlexW2116424211MaRDI QIDQ5276126

Jérémie Decock, Olivier Teytaud

Publication date: 14 July 2017

Published in: Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00755663/file/foga006-decock.pdf

zbMATH Keywords

noisy optimizationlocal samplingblack box complexity model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Simple and cumulative regret for continuous noisy optimization

This page was built for publication: Noisy optimization complexity under locality assumption