On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics

DOI10.1017/S0963548304006650zbMath1062.68049OpenAlexW2075706745WikidataQ57200674 ScholiaQ57200674MaRDI QIDQ4660566

Ingo Wegener, Carsten Witt

Publication date: 4 April 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548304006650

zbMATH Keywords

simulated annealingevolutionary algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (12)

The effect of multiple optima on the simple GA run-time complexity ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Black-box search by unbiased variation ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation ⋮ Multiplicative up-drift ⋮ Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions ⋮ A self-stabilizing algorithm for cut problems in synchronous networks ⋮ When to use bit-wise neutrality ⋮ Population size versus runtime of a simple evolutionary algorithm

This page was built for publication: On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics