The PSO convergence analysis is mainly based on the constant attractor, however, the attractor of PSO algorithm in the evolutionary process is time-varying point. So, the objective of this study is to mainly discuss the random convergence analysis of the standard and improved particle swarm ...
The random drift particle swarm optimization (RDPSO) algorithm is a PSO variant inspired by the free electron model in metal conductors placed in an external electric field. Based on the preliminary work on the RDPSO algorithm, this paper makes systematical analyses and empirical studies of the ...
artificial fishswarmNelder–Mead searchThis article presents a shifted hyperbolic penalty function and proposes an augmented Lagrangian-based algorithm for non-convex constrained global optimization problems. Convergence to an -global minimizer is proved. At each iteration k, the algorithm requires the -...
3)convergence analysis收敛分析 1.We proved some properties of P-η proximal point mapping,and used the technique to discuss the convergence analysis of iterative algorithm for generalized nonlinear mix quasi-variational inclusions in Banach spaces.证明了其解的存在性并讨论了此算法的收敛分析。 4)superco...
Recently, Pluhacek et al. [131] performed a comprehensive bibliographic analysis focusing on the integration of chaos maps with metaheuristic algorithms. Then, they highlighted three well-established algorithms: Genetic Algorithm (GA), differential evolution (DE), and particle swarm optimization (PSO)....
Moreover, the convergence of the training was proved based on the differentiability of the error function. SpikeProp algorithm is based on gradient descent method for SNNs. But it is difficult for normal SNNs to prove the convergence. In this paper, a smoothing L1∕2 regularization term is ...
7.Convergence Analysis of Standard Particle Swarm Optimization Algorithm标准的微粒群优化算法的收敛性分析 8.Uniform Convergence, Convergence and Weak Convergence;一致收敛 点点收敛 弱收敛之关系探讨 9.On Convergence Property of Sequential kegularization Sum of Grid-point Distribution;格子点分布序列的正则化和...
A Simplex Method Based Improved Particle Swarm Optimization and Analysis on Its Global Convergence一种基于单纯形法的改进微粒群优化算法及其收敛性分析Parallelparticle swarm optimization (PSOsimplex method (SMmulti-populationvelocity escape 并行微粒群优化...
Markov chain theoryOptimizationSwarm intelligenceThe cuckoo search (CS) algorithm is a powerful metaheuristic algorithm for solving nonlinear global optimization problems. In this book chapter, we prove the global convergence of this algorithm usingdoi:10.1007/978-3-319-67669-2_3Xing-Shi He...
The choice of the parameter μn is similar in concept to the choice of the step size in the LMS algorithm. In particular, the larger μn, the faster the convergence speed, at the expense of a higher steady-state error floor. In practice, a step size approximately equal to 0.5Mn will ...