Kinetic models for optimization: a unified mathematical framework for metaheuristics
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929541043191808 |
|---|---|
| author | Borghi, Giacomo Herty, Michael Pareschi, Lorenzo |
| author_facet | Borghi, Giacomo Herty, Michael Pareschi, Lorenzo |
| contents | Metaheuristic algorithms, widely used for solving complex non-convex and non-differentiable optimization problems, often lack a solid mathematical foundation. In this review, we explore how concepts and methods from kinetic theory can offer a potential unifying framework for a variety of metaheuristic optimization methods. By applying principles from collisional and non-collisional kinetic theory, we outline how particle-based algorithms like Simulated Annealing, Genetic Algorithms, Particle Swarm Optimization, and Ensemble Kalman Filter may be described through a common statistical perspective. This approach not only provides a path to deeper theoretical insights and connects different methods under suitable asymptotic scalings, but also enables the derivation of novel algorithms using alternative numerical solvers. While not exhaustive, our review highlights how kinetic models can enhance the mathematical understanding of existing optimization algorithms and inspire new computational strategies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_10369 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Kinetic models for optimization: a unified mathematical framework for metaheuristics Borghi, Giacomo Herty, Michael Pareschi, Lorenzo Optimization and Control 65K10, 65C05, 82B40, 82C31, 90C26 Metaheuristic algorithms, widely used for solving complex non-convex and non-differentiable optimization problems, often lack a solid mathematical foundation. In this review, we explore how concepts and methods from kinetic theory can offer a potential unifying framework for a variety of metaheuristic optimization methods. By applying principles from collisional and non-collisional kinetic theory, we outline how particle-based algorithms like Simulated Annealing, Genetic Algorithms, Particle Swarm Optimization, and Ensemble Kalman Filter may be described through a common statistical perspective. This approach not only provides a path to deeper theoretical insights and connects different methods under suitable asymptotic scalings, but also enables the derivation of novel algorithms using alternative numerical solvers. While not exhaustive, our review highlights how kinetic models can enhance the mathematical understanding of existing optimization algorithms and inspire new computational strategies. |
| title | Kinetic models for optimization: a unified mathematical framework for metaheuristics |
| topic | Optimization and Control 65K10, 65C05, 82B40, 82C31, 90C26 |
| url | https://arxiv.org/abs/2410.10369 |