Direct search based on probabilistic feasible descent for bound and linearly constrained problems
Direct search is a methodology for derivative-free optimization whose iterations are characterized by evaluating the objective function using a set of polling directions. In deterministic direct search applied to smooth objectives, these directions must somehow conform to the geometry of the feasibl...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/89442 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/89442 |