Worst case complexity of direct search
In this paper, we prove that the broad class of direct-search methods of directional type based on imposing sufficient decrease to accept new iterates shares the worst case complexity bound of steepest descent for the unconstrained minimization of a smooth function, more precisely that the number of...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2013
|
| Texto completo: | http://hdl.handle.net/10316/45707 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/45707 |