๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Conjugate direction particle swarm optimization solving systems of nonlinear equations

โœ Scribed by Yuanbin Mo; Hetong Liu; Qin Wang


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
344 KB
Volume
57
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis


Solving systems of nonlinear equations is a difficult problem in numerical computation. For most numerical methods such as the Newton's method for solving systems of nonlinear equations, their convergence and performance characteristics can be highly sensitive to the initial guess of the solution supplied to the methods. However, it is difficult to select a good initial guess for most systems of nonlinear equations. Aiming to solve these problems, Conjugate Direction Particle Swarm Optimization (CDPSO) was put forward, which introduced conjugate direction method into Particle Swarm Optimization (PSO)in order to improve PSO, and enable PSO to effectively optimize high-dimensional optimization problem. In one optimization problem, when after some iterations PSO got trapped in local minima with local optimal solution x * , conjugate direction method was applied with x * as a initial guess to optimize the problem to help PSO overcome local minima by changing highdimension function optimization problem into low-dimensional function optimization problem. Because PSO is efficient in solving the low-dimension function optimization problem, PSO can efficiently optimize high-dimensional function optimization problem by this tactic. Since CDPSO has the advantages of Method of Conjugate Direction (CD) and Particle Swarm Optimization (PSO), it overcomes the inaccuracy of CD and PSO for solving systems of nonlinear equations. The numerical results showed that the approach was successful for solving systems of nonlinear equations.


๐Ÿ“œ SIMILAR VOLUMES


Identification and control of nonlinear
โœ Hong-Wei Ge; Feng Qian; Yan-Chun Liang; Wen-li Du; Lu Wang ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 357 KB

In this paper, we first present a learning algorithm for dynamic recurrent Elman neural networks based on a dissimilation particle swarm optimization. The proposed algorithm computes concurrently both the evolution of network structure, weights, initial inputs of the context units, and self-feedback