Augmented lagrangian constraint handling for CMA-ES — Case of a single linear constraint

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the problem of minimizing a function f subject to a single inequality constraint g(x) ≤ 0, in a black-box scenario. We present a covariance matrix adaptation evolution strategy using an adaptive augmented Lagrangian method to handle the constraint. We show that our algorithm is an instance of a general framework that allows to build an adaptive constraint handling algorithm from a general randomized adaptive algorithm for unconstrained optimization. We assess the performance of our algorithm on a set of linearly constrained functions, including convex quadratic and ill-conditioned functions, and observe linear convergence to the optimum.

Original languageEnglish
Title of host publicationParallel Problem Solving from Nature - 14th International Conference, PPSN 2016, Proceedings
EditorsEmma Hart, Ben Paechter, Julia Handl, Manuel López-Ibáñez, Peter R. Lewis, Gabriela Ochoa
PublisherSpringer Verlag
Pages181-191
Number of pages11
ISBN (Print)9783319458229
DOIs
Publication statusPublished - 1 Jan 2016
Externally publishedYes
Event14th International Conference on Parallel Problem Solving from Nature, PPSN 2016 - Edinburgh, United Kingdom
Duration: 17 Sept 201621 Sept 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9921 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Parallel Problem Solving from Nature, PPSN 2016
Country/TerritoryUnited Kingdom
CityEdinburgh
Period17/09/1621/09/16

Fingerprint

Dive into the research topics of 'Augmented lagrangian constraint handling for CMA-ES — Case of a single linear constraint'. Together they form a unique fingerprint.

Cite this