How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms

DOI10.1016/J.TCS.2006.04.004MaRDI QIDQ2503340zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jens Jägersküpper

Publication date 14 September 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.04.004

zbMATH Keywords

continuous optimizationevolutionary direct search methodprobabilistic analysis of runtime

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Foundations of Genetic Algorithms
• scientific article; zbMATH DE number 2038775
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• scientific article; zbMATH DE number 2013504
• On the analysis of the \((1+1)\) evolutionary algorithm

Cites work

• Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties.
• scientific article; zbMATH DE number 1664952 (Why is no real title available?)
• scientific article; zbMATH DE number 4033058 (Why is no real title available?)
• scientific article; zbMATH DE number 1962832 (Why is no real title available?)
• scientific article; zbMATH DE number 2038775 (Why is no real title available?)
• scientific article; zbMATH DE number 1754585 (Why is no real title available?)
• On the analysis of the \((1+1)\) evolutionary algorithm
• Probability Inequalities for Sums of Bounded Random Variables
• STACS 2005

Cited in

(12)

• Efficient covariance matrix update for variable metric evolution strategies
• An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
• Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front
• Globally convergent evolution strategies
• Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions
• Evolutionary algorithms for continuous-space optimisation
• Drift conditions for estimating the first hitting times of evolutionary algorithms
• Foundations of Genetic Algorithms
• Multistart global optimization with tunnelling and an evolutionary strategy supervised by a martingale
• Global linear convergence of evolution strategies with recombination on scaling-invariant functions
• On asymptotic convergence rate of random search
• On exponential convergence of random variables

This page was built for publication: How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms

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