no code implementations • 18 Apr 2019 • Cheikh Touré, Nikolaus Hansen, Anne Auger, Dimo Brockhoff
We present a framework to build a multiobjective algorithm from single-objective ones.
1 code implementation • 15 Mar 2019 • Ouassim Elhara, Konstantinos Varelas, Duc Nguyen, Tea Tusar, Dimo Brockhoff, Nikolaus Hansen, Anne Auger
The bbob-largescale test suite, containing 24 single-objective functions in continuous domain, extends the well-known single-objective noiseless bbob test suite, which has been used since 2009 in the BBOB workshop series, to large dimension.
no code implementations • 1 Dec 2018 • Cheikh Toure, Anne Auger, Dimo Brockhoff, Nikolaus Hansen
In this paper we analyze theoretical properties of bi-objective convex-quadratic problems.
no code implementations • 9 Feb 2018 • Youhei Akimoto, Anne Auger, Tobias Glasmachers
This paper explores the use of the standard approach for proving runtime bounds in discrete domains---often referred to as drift analysis---in the context of optimization on a continuous domain.
1 code implementation • 11 May 2016 • Nikolaus Hansen, Anne Auger, Dimo Brockhoff, Dejan Tušar, Tea Tušar
We present an any-time performance assessment for benchmarking numerical optimization algorithms in a black-box scenario, applied within the COCO benchmarking platform.
no code implementations • 5 May 2016 • Dimo Brockhoff, Tea Tušar, Dejan Tušar, Tobias Wagner, Nikolaus Hansen, Anne Auger
This document details the rationales behind assessing the performance of numerical black-box optimizers on multi-objective problems within the COCO platform and in particular on the biobjective test suite bbob-biobj.
no code implementations • 1 Apr 2016 • Dimo Brockhoff, Tea Tusar, Anne Auger, Nikolaus Hansen
Several test function suites are being used for numerical benchmarking of multiobjective optimization algorithms.
no code implementations • 29 Mar 2016 • Nikolaus Hansen, Tea Tusar, Olaf Mersmann, Anne Auger, Dimo Brockhoff
We present a budget-free experimental setup and procedure for benchmarking numericaloptimization algorithms in a black-box scenario.
10 code implementations • 29 Mar 2016 • Nikolaus Hansen, Anne Auger, Raymond Ros, Olaf Mersmann, Tea Tušar, Dimo Brockhoff
We introduce COCO, an open source platform for Comparing Continuous Optimizers in a black-box setting.
no code implementations • 11 Apr 2014 • Alexandre Chotard, Anne Auger, Nikolaus Hansen
This paper analyses a $(1,\lambda)$-Evolution Strategy, a randomised comparison-based adaptive search algorithm, on a simple constraint optimisation problem.