A Continuation Method Based on CMA-ES

Hoang Nguyen Vu, Dimo Brockhoff

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

Abstract

In this poster, we showcase a new algorithm for approximating the Pareto set of two-objective (unconstrained) optimization problems based on the idea of continuation. The algorithm tries to move “along” the Pareto set from one single-objective optimum to the other and back via a single-objective reformulation of the two-objective problem and the well-known CMA-ES as single-objective solver. The introduced algorithm BOG-CMA-ES (standing for biobjective gradient based CMA-ES) is visually analyzed on simple convex-quadratic objective functions and extensively benchmarked on the bbob-biobj test suite of the COCO platform, including comparisons with current state-of-the-art algorithms.

Original languageEnglish
Title of host publicationGECCO 2025 Companion - Proceedings of the 2025 Genetic and Evolutionary Computation Conference Companion
EditorsGabriela Ochoa
PublisherAssociation for Computing Machinery, Inc
Pages439-442
Number of pages4
ISBN (Electronic)9798400714641
DOIs
Publication statusPublished - 11 Aug 2025
Event2025 Genetic and Evolutionary Computation Conference Companion, GECCO 2025 Companion - Malaga, Spain
Duration: 14 Jul 202518 Jul 2025

Publication series

NameGECCO 2025 Companion - Proceedings of the 2025 Genetic and Evolutionary Computation Conference Companion

Conference

Conference2025 Genetic and Evolutionary Computation Conference Companion, GECCO 2025 Companion
Country/TerritorySpain
CityMalaga
Period14/07/2518/07/25

Fingerprint

Dive into the research topics of 'A Continuation Method Based on CMA-ES'. Together they form a unique fingerprint.

Cite this