A particle swarm pattern search method for bound constrained global optimization |
| |
Authors: | A. Ismael F. Vaz Luís N. Vicente |
| |
Affiliation: | 1.Departamento de Produ??o e Sistemas, Escola de Engenharia,Universidade do Minho,Braga,Portugal;2.Departamento de Matemática,Universidade de Coimbra,Coimbra,Portugal |
| |
Abstract: | In this paper we develop, analyze, and test a new algorithm for the global minimization of a function subject to simple bounds without the use of derivatives. The underlying algorithm is a pattern search method, more specifically a coordinate search method, which guarantees convergence to stationary points from arbitrary starting points. In the optional search phase of pattern search we apply a particle swarm scheme to globally explore the possible nonconvexity of the objective function. Our extensive numerical experiments showed that the resulting algorithm is highly competitive with other global optimization methods also based on function values. Support for Luís N. Vicente was provided by Centro de Matemática da Universidade de Coimbra and by FCT under grant POCI/MAT/59442/2004. |
| |
Keywords: | Direct search Pattern search Particle swarm Derivative free optimization Global optimization Bound constrained nonlinear optimization |
本文献已被 SpringerLink 等数据库收录! |
|