Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/7724
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Vaz, A. | - |
dc.contributor.author | Vicente, Luís | - |
dc.date.accessioned | 2009-02-17T11:18:41Z | - |
dc.date.available | 2009-02-17T11:18:41Z | - |
dc.date.issued | 2007 | en_US |
dc.identifier.citation | Journal of Global Optimization. 39:2 (2007) 197-219 | en_US |
dc.identifier.uri | https://hdl.handle.net/10316/7724 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | eng | eng |
dc.rights | openAccess | eng |
dc.title | A particle swarm pattern search method for bound constrained global optimization | en_US |
dc.type | article | en_US |
dc.identifier.doi | 10.1007/s10898-007-9133-5 | en_US |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.orcid | 0000-0003-1097-6384 | - |
Aparece nas coleções: | FCTUC Matemática - Artigos em Revistas Internacionais |
Citações SCOPUSTM
267
Visto em 30/set/2024
Citações WEB OF SCIENCETM
1
232
Visto em 2/out/2024
Visualizações de página 50
550
Visto em 1/out/2024
Downloads 50
596
Visto em 1/out/2024
Google ScholarTM
Verificar
Altmetric
Altmetric
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.