Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions

From MaRDI portal
Revision as of 06:24, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4911174

DOI10.1017/S0963548312000600zbMath1258.68183DBLPjournals/cpc/Witt13arXiv1108.4386OpenAlexW2102044362WikidataQ57200604 ScholiaQ57200604MaRDI QIDQ4911174

Carsten Witt

Publication date: 14 March 2013

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

Full work available at URL: https://arxiv.org/abs/1108.4386




Related Items (43)

The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMaxOn easiest functions for mutation operators in bio-inspired optimisationSuperpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problemsThe impact of random initialization on the runtime of randomized search heuristicsDrift Analysis and Evolutionary Algorithms RevisitedA rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functionsTight bounds on the expected runtime of a standard steady state genetic algorithmDoes comma selection help to cope with local optima?Self-adjusting evolutionary algorithms for multimodal optimizationFast mutation in crossover-based algorithmsFixed-target runtime analysisRuntime analysis for self-adaptive mutation ratesA tight runtime analysis for the \((\mu + \lambda)\) EAConcentrated Hitting Times of Randomized Search Heuristics with Variable DriftAnalysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraintsLower bounds on the run time of the univariate marginal distribution algorithm on OneMaxAnalyzing randomized search heuristics via stochastic dominationOneMax is not the easiest function for fitness improvementsTwo-dimensional drift analysis: optimizing two functions simultaneously can be hardLower bounds from fitness levels made easySelf-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matterAn extended jump functions benchmark for the analysis of randomized search heuristicsOn the benefits of populations for the exploitation speed of standard steady-state genetic algorithmsExponential upper bounds for the runtime of randomized search heuristicsUpper bounds on the running time of the univariate marginal distribution algorithm on OneMaxSolving problems with unknown solution length at almost no extra costReoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraintsIsland models meet rumor spreadingDrift analysis of ant colony optimization of stochastic linear pseudo-Boolean functionsOptimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instancesFrom black-box complexity to designing new genetic algorithmsOn the choice of the update strength in estimation-of-distribution algorithms and ant colony optimizationThe runtime of the compact genetic algorithm on jump functionsImproved runtime results for simple randomised search heuristics on linear functions with a uniform constraintOptimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithmOptimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysisStatic and self-adjusting mutation strengths for multi-valued decision variablesThe choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithmRunning time analysis of the (1+1)-EA for robust linear optimizationOptimal parameter choices via precise black-box analysisWorking principles of binary differential evolutionThe impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run timeThe linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates




Cites Work




This page was built for publication: Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions