On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics

DOI10.1017/S0963548304006650MaRDI QIDQ4660566zbMATH OpenOpenAlexWikidataFDO

Authors 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

evolutionary algorithmssimulated annealing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2013513
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Metropolis versus simulated annealing and the black-box-complexity of optimization problems
• scientific article; zbMATH DE number 1203312
• On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions

Cited in

(14)

• Black-box search by unbiased variation
• Exponential upper bounds for the runtime of randomized search heuristics
• Multiplicative up-drift
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• Population size versus runtime of a simple evolutionary algorithm
• The use of tail inequalities on the probable computational time of randomized search heuristics
• scientific article; zbMATH DE number 2013513 (Why is no real title available?)
• Tight bounds on the optimization time of a randomized search heuristic on linear functions
• Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
• Fourier analysis meets runtime analysis: precise runtimes on plateaus
• Why dominance is not enough: lessons from practical evolutionary multi-objective algorithms
• The effect of multiple optima on the simple GA run-time complexity
• A self-stabilizing algorithm for cut problems in synchronous networks
• When to use bit-wise neutrality

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660566)