Kinetic description and convergence analysis of genetic algorithms for global optimization

DOI10.4310/CMS.250208214404MaRDI QIDQ6974478zbMATH OpenFDO

Authors Giacomo Borghi, Lorenzo Pareschi

Publication date 6 June 2025

Published in Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/CMS.250208214404

zbMATH Keywords

Boltzmann equationgenetic algorithmsglobal optimizationmean field equationsstochastic particle systems

Mathematics Subject Classification ID

Boltzmann equations (35Q20) PDEs in connection with mathematical programming (35Q90) Stochastic particle methods (65C35) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(5)

• Chaos propagation in genetic algorithms: an optimal transport approach
• Consensus-based algorithms for stochastic optimization problems
• Kinetic variable-sample methods for stochastic optimization problems
• Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
• Superlinear drift in consensus-based optimization with condensation phenomena

This page was built for publication: Kinetic description and convergence analysis of genetic algorithms for global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974478)