A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
In order to be provably convergent towards a second-order stationary point, optimization methods applied to nonconvex problems must necessarily exploit both first and second-order information. However, as revealed by recent complexity analyses of some of these methods, the overall effort to reach se...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2020
|
| Texto completo: | http://hdl.handle.net/10316/89471 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/89471 |