arXiv Analytics

Sign in

arXiv:2211.03378 [math.OC]AbstractReferencesReviewsResources

Repulsion dynamics for uniform Pareto front approximation in multi-objective optimization problems

Giacomo Borghi

Published 2022-11-07Version 1

Scalarization allows to solve a multi-objective optimization problem by solving many single-objective sub-problems, uniquely determined by some parameters. In this work, we propose several adaptive strategies to select such parameters in order to obtain a uniform approximation of the Pareto front. This is done by introducing a heuristic dynamics where the parameters interact through a binary repulsive potential. The approach aims to minimize the associated energy potential which is used to quantify the diversity of the computed solutions. A stochastic component is also added to overcome non-optimal energy configurations. Numerical experiments show the validity of the proposed approach for bi- and tri-objectives problems with different Pareto front geometries.

Related articles: Most relevant | Search more
arXiv:2208.01362 [math.OC] (Published 2022-08-02)
An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation
arXiv:1910.08615 [math.OC] (Published 2019-10-18)
Fitting a Kalman Smoother to Data
arXiv:2406.08147 [math.OC] (Published 2024-06-12)
A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization