Search Results for author:
Found 10 papers, 3 papers with code
Uncrowded Hypervolume Improvement: COMO-CMA-ES and the Sofomore framework
We present a framework to build a multiobjective algorithm from single-objective ones.
COCO: The Large Scale Black-Box Optimization Benchmarking (bbob-largescale) Test Suite
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.
On Bi-Objective convex-quadratic problems
In this paper we analyze theoretical properties of bi-objective convex-quadratic problems.
Drift Theory in Continuous Search Spaces: Expected Hitting Time of the (1+1)-ES with 1/5 Success Rule
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.
COCO: Performance Assessment
We present an any-time performance assessment for benchmarking numerical optimization algorithms in a black-box scenario, applied within the COCO benchmarking platform.
Biobjective Performance Assessment with the COCO Platform
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.
Using Well-Understood Single-Objective Functions in Multiobjective Black-Box Optimization Test Suites
Several test function suites are being used for numerical benchmarking of multiobjective optimization algorithms.
COCO: The Experimental Procedure
We present a budget-free experimental setup and procedure for benchmarking numericaloptimization algorithms in a black-box scenario.
COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Setting
We introduce COCO, an open source platform for Comparing Continuous Optimizers in a black-box setting.
Markov Chain Analysis of Evolution Strategies on a Linear Constraint Optimization Problem
This paper analyses a $(1,\lambda)$-Evolution Strategy, a randomised comparison-based adaptive search algorithm, on a simple constraint optimisation problem.
