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

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)68-97
Number of pages30
JournalTheoretical Computer Science
Volume832
DOIs
Publication statusPublished - 6 Sept 2020

Keywords

  • Adaptive randomized algorithms
  • Augmented Lagrangian
  • Constrained optimization
  • Evolution strategies
  • Invariance
  • Markov chain

Fingerprint

Dive into the research topics of 'On invariance and linear convergence of evolution strategies with augmented Lagrangian constraint handling'. Together they form a unique fingerprint.

Cite this