On invariance and linear convergence of evolution strategies with augmented Lagrangian constraint handling

In the context of numerical constrained optimization, we investigate stochastic algorithms, in particular evolution strategies, handling constraints via augmented Lagrangian approaches. In those approaches, the original constrained problem is turned into an unconstrained one and the function optimized is an augmented Lagrangian whose parameters are adapted during the optimization. The use of an augmented Lagrangian however breaks a central invariance property of evolution strategies, namely invariance to strictly increasing transformations of the objective function. We formalize nevertheless that an evolution strategy with augmented Lagrangian constraint handling should preserve invariance to strictly increasing affine transformations of the objective function and the scaling of the constraints—a subclass of strictly increasing transformations. We show that this invariance property is important for the linear convergence of these algorithms and show how both properties are connected.

[1]  Anne Auger,et al.  Linearly Convergent Evolution Strategies via Augmented Lagrangian Constraint Handling , 2017, FOGA '17.

[2]  A. Auger,et al.  Verifiable conditions for the irreducibility and aperiodicity of Markov chains by analyzing underlying deterministic models , 2015, Bernoulli.

[3]  Olivier François,et al.  Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties , 2003, Theor. Comput. Sci..

[4]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[5]  Anne Auger,et al.  Augmented Lagrangian Constraint Handling for CMA-ES - Case of a Single Linear Constraint , 2016, PPSN.

[6]  Kalyanmoy Deb,et al.  A genetic algorithm based augmented Lagrangian method for constrained optimization , 2012, Comput. Optim. Appl..

[7]  Anne Auger,et al.  Linear Convergence on Positively Homogeneous Functions of a Comparison Based Step-Size Adaptive Randomized Search: the (1+1) ES with Generalized One-fifth Success Rule , 2013, ArXiv.

[8]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[9]  Min-Jea Tahk,et al.  Coevolutionary augmented Lagrangian methods for constrained optimization , 2000, IEEE Trans. Evol. Comput..

[10]  José Mario Martínez,et al.  Global minimization using an Augmented Lagrangian method with variable lower-level constraints , 2010, Math. Program..

[11]  Anne Auger,et al.  Analysis of Linear Convergence of a (1 + 1)-ES with Augmented Lagrangian Constraint Handling , 2016, GECCO.

[12]  M. J. D. Powell,et al.  A method for nonlinear constraints in minimization problems , 1969 .

[13]  Robert Michael Lewis,et al.  A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds , 2002, SIAM J. Optim..

[14]  Anne Auger,et al.  Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains , 2013, SIAM J. Optim..

[15]  Anne Auger,et al.  Convergence results for the (1, lambda)-SA-ES using the theory of phi-irreducible Markov chains , 2005, Theor. Comput. Sci..

[16]  Dirk V. Arnold,et al.  Towards an Augmented Lagrangian Constraint Handling Approach for the (1+1)-ES , 2015, GECCO.

[17]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[18]  P. Toint,et al.  A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds , 1991 .

[19]  Dirk V. Arnold,et al.  Optimal Weighted Recombination , 2005, FOGA.