Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
In the context of the derivative-free optimization of a smooth objective function, it has been shown that the worst-case complexity of direct-search methods is of the same order as that of the steepest descent for derivative-based optimization; more precisely, the number of iterations needed to redu...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2013
|
| Texto completo: | http://hdl.handle.net/10316/45705 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/45705 |