A velocity-combined local best particle swarm optimization algorithm for nonlinear equations (Q2007124)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A velocity-combined local best particle swarm optimization algorithm for nonlinear equations |
scientific article; zbMATH DE number 7259636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A velocity-combined local best particle swarm optimization algorithm for nonlinear equations |
scientific article; zbMATH DE number 7259636 |
Statements
A velocity-combined local best particle swarm optimization algorithm for nonlinear equations (English)
0 references
12 October 2020
0 references
Summary: Many people use traditional methods such as quasi-Newton method and Gauss-Newton-based BFGS to solve nonlinear equations. In this paper, we present an improved particle swarm optimization algorithm to solve nonlinear equations. The novel algorithm introduces the historical and local optimum information of particles to update a particle's velocity. Five sets of typical nonlinear equations are employed to test the quality and reliability of the novel algorithm search comparing with the PSO algorithm. Numerical results show that the proposed method is effective for the given test problems. The new algorithm can be used as a new tool to solve nonlinear equations, continuous function optimization, etc., and the combinatorial optimization problem. The global convergence of the given method is established.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references