A particle swarm pattern search method for bound constrained nonlinear optimization
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...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | other |
| Idioma: | eng |
| Publicado em: |
2006
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/11372 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/11372 |