Energy-Stable Swarm-Based Inertial Algorithms for Optimization

Abstract We formulate the swarming optimization problem as a weakly coupled, dissipative dynamical system governed by a controlled energy dissipation rate and initial velocities that adhere to the nonequilibrium Onsager principle. In this formulation, agents’ inertia, positions, and masses are dynamically coupled. To enable rapid convergence toward equilibrium, we develop a class of efficient, energy-stable numerical algorithms for the dynamical system that preserve or enhance energy dissipation at the discrete level. At the equilibrium, the system reaches one of the lowest local minima explored by the agents, thereby improving the likelihood of identifying the global minimum. Numerical experiments confirm the effectiveness of the proposed approach, demonstrating significant advantages over traditional swarm-based gradient descent methods, especially when operating with a limited number of agents.

Authors

Institutions

Publication Details

Journal
Journal of Scientific Computing
Published
2025-09-25
DOI
https://doi.org/10.1007/s10915-025-03041-6
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Energy-Stable Swarm-Based Inertial Algorithms for Optimization

Qi Wang, Xuelong Gu
Journal of Scientific Computing
Metaheuristic Optimization Algorithms Research
article

Energy-Stable Swarm-Based Inertial Algorithms for Optimization

Qi Wang, Xuelong Gu
article en

Abstract

Abstract We formulate the swarming optimization problem as a weakly coupled, dissipative dynamical system governed by a controlled energy dissipation rate and initial velocities that adhere to the nonequilibrium Onsager principle. In this formulation, agents’ inertia, positions, and masses are dynamically coupled. To enable rapid convergence toward equilibrium, we develop a class of efficient, energy-stable numerical algorithms for the dynamical system that preserve or enhance energy dissipation at the discrete level. At the equilibrium, the system reaches one of the lowest local minima explored by the agents, thereby improving the likelihood of identifying the global minimum. Numerical experiments confirm the effectiveness of the proposed approach, demonstrating significant advantages over traditional swarm-based gradient descent methods, especially when operating with a limited number of agents.

Journal of Scientific ComputingVol. 105(2)
University of South Carolina (US)
National Science Foundation, U.S. Department of Energy
Openalex Percentile: Top 86%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Energy-Stable Swarm-Based Inertial Algorithms for Optimization — Qi Wang, Xuelong Gu · Journal of Scientific Computing (2025) | TGRS Research Map | TGRS