Random Drift Particle Swarm Optimization Algorithm Based on Riemannian Manifolds

Read full text Summarise with VIRAT
Authors: Yeerjiang Halimu, Min Shan, Chao Zhou, J. Shen J.F. Sun
Cited by: 0
References: 26

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

In this paper, we propose the Manifold Random Drift Particle Swarm Optimization (MRDPSO) algorithm for matrix optimization on smooth manifolds. Conventional swarm intelligence methods generally converge prematurely in constrained domains. To mitigate this issue, we introduce the swarm intelligence methods to the manifold and a Random Drift mechanism that regulates the search process. Using Riemannian geometry, our framework treats constrained problems as unconstrained ones on the manifold, which preserves the intrinsic geometric structure of the data. Particles are initialized on the manifold, while updates are performed in tangent spaces. Since geodesic calculations are computationally expensive, we use an inverse retraction as a faster alternative to standard logarithmic mapping. Numerical experiments on Grassmann, Stiefel, and Oblique manifolds show that MRDPSO achieves higher accuracy and superior convergence stability compared to recent state-of-the-art manifold-adapted heuristics, namely IISSO and MSSO.

Fields of Study & Subjects

Metaheuristic Optimization Algorithms Research Advanced Optimization Algorithms Research Stochastic Gradient Optimization Techniques

Publication details

Journal / source
Mathematics
Volume
14
Issue
7
Pages
1157–1157
Publication date
30 March 2026
Language
EN