Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
type: Item
instance of: scholarly article
title: Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
zbMATH Open document ID: 1338.90259
author: Youhei Akimoto
author: Sandra Astete-Morales
author: Olivier Teytaud
published in: Theoretical Computer Science
publication date: 2015-10-30T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6502577
zbMATH Keywords: discrete optimization
zbMATH Keywords: additive noise
zbMATH Keywords: runtime analysis
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.04.008
OpenAlex ID: W2144246951
cites work: Q4247126
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Upper and lower bounds for randomized search heuristics in black-box optimization
cites work: Stochastic Approximation of Minima with Improved Asymptotic Speed
cites work: Log-linear convergence and divergence of the scale-invariant \((1+1)\)-ES in noisy environments
cites work: A derivative based surrogate model for approximating and optimizing the output of an expensive computer simulation
cites work: Simplified drift analysis for proving lower bounds in evolutionary computation
DOI: 10.1016/J.TCS.2015.04.008
description: scientific article; zbMATH DE number 6502577