The reviewed record of science sign in
Pith

arxiv: 2407.09257 · v2 · pith:G4B3EHWA · submitted 2024-07-12 · math.OC

A multiscale Consensus-Based algorithm for multi-level optimization

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:G4B3EHWArecord.jsonopen to challenge →

classification math.OC
keywords optimizationproblemsalgorithmmultiscaleconsensus-baseddynamicsexistingmethod
0
0 comments X
read the original abstract

A novel multiscale consensus-based optimization (CBO) algorithm for solving bi- and tri-level optimization problems is introduced. Existing CBO techniques are generalized by the proposed method through the employment of multiple interacting populations of particles, each of which is used to optimize one level of the problem. These particle populations are evolved through multiscale-in-time dynamics, which are formulated as a singularly perturbed system of stochastic differential equations. Theoretical convergence analysis for the multiscale CBO model to an averaged effective dynamics as the time-scale separation parameter approaches zero is provided. The resulting algorithm is presented for both bi-level and tri-level optimization problems. The effectiveness of the approach in tackling complex multi-level optimization tasks is demonstrated through numerical experiments on various benchmark functions. Additionally, it is shown that the proposed method performs well on min-max optimization problems, comparing favorably with existing CBO algorithms for saddle point problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.