Here we briefly summarize the main findings of the above-mentioned paper by Hernández et al., 2024 [3]. In this paper, we address the computation of finite-size approximations of the set of ϵ-locally optimal solutions of a multi-objective optimization problem (MOP), a problem relevant in multi-objective multimodal optimization (MMMO). We propose a bounded archiver, ArchiveUpdateLQ,ϵB, the algorithm LQ,ϵMOEA, which directly uses this archiver in selection, and a hybrid with a multi-objective continuation method for improved accuracy when gradient information is available. Numerical results demonstrate the benefits of the proposed methods.
C. H. Hernández Castellanos, A. Rodríguez-Fernandez, Lennart Schäpermeier et al.· Proceedings of the Genetic a...· 0 citations
The evaluation of heuristic optimizers on test problems, better known as benchmarking, is a cornerstone of research in multiobjective optimization. However, many frequently used test problems either feature a limited degree of optimization challenges or have poorly understood reference solutions. Here, we present an overview of BONO-Bench [5], a recently proposed problem generator and benchmark set for bi-objective numerical optimization. Building on convex-quadratic problems, it features diverse challenges ranging from different levels of conditioning, shapes of Pareto set and front as well as plateaus to different structured and unstructured multimodality patterns. Furthermore, we enable best practices for empirical runtime analysis of optimizers using reference solutions that can be approximated to an arbitrary degree, resulting in precise target values for the hypervolume and exact R2 indicators.
Lennart Schäpermeier, P. Kerschke· Proceedings of the Genetic a...· 0 citations