Worst case complexity of direct search under convexity
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, exhibits the same worst case complexity bound and global rate of the gradient method for the unconstrained minimization of a convex and smooth funct...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2016
|
| Texto completo: | http://hdl.handle.net/10316/45246 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/45246 |