Papers › A consensus-based algorithm for multi-objective optimization and its mean-field description
A consensus-based algorithm for multi-objective optimization and its mean-field description
Giacomo Borghi, Michael Herty, Lorenzo Pareschi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present a multi-agent algorithm for multi-objective optimization problems, which extends the class of consensus-based optimization methods and relies on a scalarization strategy. The optimization is achieved by a set of interacting agents exploring the search space and attempting to solve all scalar sub-problems simultaneously. We show that those dynamics are described by a mean-field model, which is suitable for a theoretical analysis of the algorithm convergence. Numerical results show the validity of the proposed method.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections