A particle swarm pattern search method for bound constrained global optimization

  • Authors:
  • A. Ismael Vaz;Luís N. Vicente

  • Affiliations:
  • Departamento de Produção e Sistemas, Escola de Engenharia, Universidade do Minho, Braga, Portugal 4710-057;Departamento de Matemática, Universidade de Coimbra, Coimbra, Portugal 3001-454

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

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.