Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions
From MaRDI portal
Publication:5081786
Recommendations
- Global linear convergence of evolution strategies with recombination on scaling-invariant functions
- Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties.
- scientific article; zbMATH DE number 1100794
- Globally convergent evolution strategies for constrained optimization
- A new kind of evolutionary strategy and its global convergence properties
- Linearly convergent evolution strategies via augmented Lagrangian constraint handling
- scientific article; zbMATH DE number 5151416
- Global convergence results for single parent evolution strategies
- On invariance and linear convergence of evolution strategies with augmented Lagrangian constraint handling
Cites work
- A stochastic line search method with expected complexity analysis
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Adaptive drift analysis
- Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
- Bounds on absorption times of directionally biased random sequences
- CMA-ES-based structural topology optimization using a level set boundary expression -- application to optical and carpet cloaks
- Complexity and global rates of trust-region methods based on probabilistic models
- Convergence of trust-region methods based on probabilistic models
- Convex optimization: algorithms and complexity
- Derivative-free optimization methods
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Direct search based on probabilistic descent
- Drift analysis and average time complexity of evolutionary algorithms
- Drift analysis and evolutionary algorithms revisited
- Foundations of Genetic Algorithms
- Generalized drift analysis in continuous domain. Linear convergence of (1+1)-ES on strongly convex functions with Lipschitz continuous gradients
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Globally convergent evolution strategies
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
- scientific article; zbMATH DE number 2038775 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Learning probability distributions in continuous evolutionary algorithms -- a comparative review
- Lectures on convex optimization
- Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Multiplicative drift analysis
- On a Strong Law of Large Numbers for Martingales
- Optimization of convex functions with random pursuit
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Variable metric random pursuit
Cited in
(9)- Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties.
- Convergence behavior of the \((1\overset{+},\lambda)\) evolution strategy on the ridge functions
- Theory of evolution strategies: a new perspective
- Generalized drift analysis in continuous domain. Linear convergence of (1+1)-ES on strongly convex functions with Lipschitz continuous gradients
- Global linear convergence of evolution strategies with recombination on scaling-invariant functions
- On evolutionary problems with a-priori bounded gradients
- Global Linear Convergence of Evolution Strategies on More Than Smooth Strongly Convex Functions
- On asymptotic convergence rate of random search
- Stochastic gradient descent for streaming linear and rectified linear systems with adversarial corruptions
This page was built for publication: Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081786)
