A locally convergent rotationally invariant particle swarm optimization algorithm

@article{Bonyadi2014ALC,
  title={A locally convergent rotationally invariant particle swarm optimization algorithm},
  author={Mohammad Reza Bonyadi and Zbigniew Michalewicz},
  journal={Swarm Intelligence},
  year={2014},
  volume={8},
  pages={159-198}
}
Several well-studied issues in the particle swarm optimization algorithm are outlined and some earlier methods that address these issues are investigated from the theoretical and experimental points of view. These issues are the: stagnation of particles in some points in the search space, inability to change the value of one or more decision variables, poor performance when the swarm size is small, lack of guarantee to converge even to a local optimum (local optimizer), poor performance when… 
Locating Potentially Disjoint Feasible Regions of a Search Space with a Particle Swarm Optimizer
TLDR
The results of this test show that the new method with nonoverlapping topology with small swarm size in each sub-swarm performs better in terms of locating different feasible regions in comparison to other topologies, such as the global best topology and the ring topology.
Searching for structural bias in particle swarm optimization and differential evolution algorithms
TLDR
The present study focuses on the search for structural bias in various variants of particle swarm optimization and differential evolution algorithms, as well as in the traditional direct search methods proposed by Nelder–Mead and Rosenbrock half a century ago, and found that these historical directsearch methods are structurally unbiased.
Analysis of Stability, Local Convergence, and Transformation Sensitivity of a Variant of the Particle Swarm Optimization Algorithm
TLDR
This paper identifies boundaries of coefficients for this algorithm that ensure particles converge to their equilibrium and investigates the local convergence property of this algorithm and proves that the original standard PSO algorithm is not sensitive to rotation, scaling, and translation of the search space.
An improved rotationally invariant PSO: A modified standard PSO-2011
TLDR
It is clarified that SPSO2011 performance is affected by the distribution of the center of the search range, and a novel update rule is proposed to improve the global search ability.
Particle Swarm Optimization Algorithm with Chaotic Mapping Model
TLDR
Experimental results show that the proposed particle swarm optimization algorithm with chaotic mapping (CM-PSO) has strong global searching ability, can effectively avoid the premature convergence problem, and the ability of the algorithm to escape from local optima.
Stability Analysis of the Particle Swarm Optimization Without Stagnation Assumption
TLDR
It is proved that the convergence of expectation and variance of the positions generated by the stochastic recurrence relation is independent of the mean and varianceof the distribution of the personal and global best vectors.
A novel particle swarm optimization algorithm for non-separable and ill-conditioned problems
TLDR
This article discusses the relation between the Hessian matrix of a function and the covariance matrix of the search distribution and proposes a simple covariance Matrix adaptation mechanism that uses the difference vector of the personal best positions.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 75 REFERENCES
Particle swarm optimization almost surely finds local optima
TLDR
It is shown that a slightly adapted PSO almost surely finds a local optimum by investigating the newly defined potential of the swarm, and for the first time results about the quality of the solution found are provided.
Particle swarm optimization almost surely finds local optima
A New Particle Swarm Algorithm and Its Globally Convergent Modifications
  • Hao Gao, Wenbo Xu
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
  • 2011
TLDR
A new mutation strategy is used, which makes it easier for particles in hybrid MRPSO (HMRPSO) to find the global optimum and which also seeks a balance between the exploration of new regions and the exploitation of the already sampled regions in the solution spaces.
Restart particle swarm optimization with velocity modulation: a scalability test
TLDR
This work incorporates two new mechanisms into the particle swarm optimization with the aim of enhancing its scalability, and shows that the proposal is scalable in all functions of the benchmark used, as well as numerically very competitive with regards to other compared optimizers.
A perturbed particle swarm algorithm for numerical optimization
Convergence behavior of the fully informed particle swarm optimization algorithm
TLDR
The idea that spatial convergence, and not a random behavior, is the cause of the poor performance of FIPS with a fully connected topology is put forward.
Particle swarm optimization: Velocity initialization
  • A. Engelbrecht
  • Computer Science
    2012 IEEE Congress on Evolutionary Computation
  • 2012
TLDR
This article illustrates that particles tend to leave the boundaries of the search space irrespective of the initialization approach, resulting in wasted search effort, and shows that random initialization increases the number of roaming particles, and that this has a negative impact on convergence time.
Scalability of a heterogeneous particle swarm optimizer
  • A. Engelbrecht
  • Computer Science
    2011 IEEE Symposium on Swarm Intelligence
  • 2011
TLDR
It is shown that the HPSO is significantly more scalable than the homogeneous PSO algorithms used in this study, and this article conducts an analysis of the scalability of the H PSO to large dimensional instances of the benchmark functions, in comparison with homogeneousPSO algorithms.
Example-based learning particle swarm optimization for continuous optimization
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
TLDR
This paper analyzes a particle's trajectory as it moves in discrete time, then progresses to the view of it in continuous time, leading to a generalized model of the algorithm, containing a set of coefficients to control the system's convergence tendencies.
...
1
2
3
4
5
...