Stability bounds and almost sure convergence of improved particle swarm optimization methods

Xin T. Tong, Kwok Pui Choi, Tze Leung Lai, Weng Kee Wong

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

Particle swarm optimization (PSO) is a member of nature-inspired metaheuristic algorithms. Its formulation is simple and does not need the computation of derivatives. It and its many variants have been applied to many different types of optimization problems across several disciplines. There have been many attempts to study the convergence properties of PSO, but a rigorous and complete proof of its almost sure convergence to the global optimum is still lacking. We propose two modified versions of PSO and prove their convergence to the global optimum. We conduct simulation studies to gain further insights into their properties and evaluate their performance relative to PSO.

Original languageEnglish
Article number30
JournalResearch in Mathematical Sciences
Volume8
Issue number2
DOIs
Publication statusPublished - 2021 Jun

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Mathematics (miscellaneous)
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Stability bounds and almost sure convergence of improved particle swarm optimization methods'. Together they form a unique fingerprint.

Cite this