Linearly Convergent Evolution Strategies via Augmented Lagrangian Constraint Handling

Abstract : We analyze linear convergence of an evolution strategy for constrained optimization with an augmented Lagrangian constraint handling approach. We study the case of multiple active linear constraints and use a Markov chain approach—used to analyze ran-domized optimization algorithms in the unconstrained case—to establish linear convergence under sufficient conditions. More specifically , we exhibit a class of functions on which a homogeneous Markov chain (defined from the state variables of the algorithm) exists and whose stability implies linear convergence. This class of functions is defined such that the augmented Lagrangian, centered in its value at the optimum and the associated Lagrange multipliers, is positive homogeneous of degree 2, and includes convex quadratic functions. Simulations of the Markov chain are conducted on linearly constrained sphere and ellipsoid functions to validate numerically the stability of the constructed Markov chain.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Asma Atamna <>
Submitted on : Friday, April 28, 2017 - 8:29:03 PM
Last modification on : Tuesday, September 19, 2017 - 1:07:46 AM
Long-term archiving on : Saturday, July 29, 2017 - 1:45:28 PM


Files produced by the author(s)



Asma Atamna, Anne Auger, Nikolaus Hansen. Linearly Convergent Evolution Strategies via Augmented Lagrangian Constraint Handling. The 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XIV), Jan 2017, Copenhagen, Denmark. pp.149 - 161, ⟨10.1145/3040718.3040732⟩. ⟨hal-01455379v2⟩



Record views


Files downloads