How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
From MaRDI portal
Publication:2503340
DOI10.1016/j.tcs.2006.04.004zbMath1103.68147OpenAlexW2023782941WikidataQ56031317 ScholiaQ56031317MaRDI QIDQ2503340
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
Analysis of algorithms (68W40) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions ⋮ Multistart global optimization with tunnelling and an evolutionary strategy supervised by a martingale ⋮ An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ Global linear convergence of evolution strategies with recombination on scaling-invariant functions ⋮ Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front ⋮ Drift conditions for estimating the first hitting times of evolutionary algorithms ⋮ Globally convergent evolution strategies ⋮ Evolutionary algorithms for continuous-space optimisation ⋮ Efficient covariance matrix update for variable metric evolution strategies
Cites Work
This page was built for publication: How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
