Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/11372
Title: | A particle swarm pattern search method for bound constrained nonlinear optimization | Authors: | Vaz, A. Ismael F. Vicente, L. N. |
Keywords: | Direct search; Pattern search; Particle swarm; Derivative free optimization; Global optimization; Bound constrained nonlinear optimization | Issue Date: | 2006 | Publisher: | Centro de Matemática da Universidade de Coimbra | Citation: | Pré-Publicações DMUC. 06-08 (2006) | 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 speci cally 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 | URI: | https://hdl.handle.net/10316/11372 | Rights: | openAccess |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Nacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
A particle swarm pattern search method.pdf | 336.55 kB | Adobe PDF | View/Open |
Page view(s) 50
363
checked on Sep 3, 2024
Download(s)
83
checked on Sep 3, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.