Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is rather than.
Saved in:
| Title: | Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is rather than. |
|---|---|
| Authors: | Gratton, S.1, serge.gratton@enseeiht.fr, Sim, C.-K.2, chee-khian.sim@port.ac.uk, Toint, Ph. L.3, philippe.toint@unamur.be |
| Source: | Computational Optimization & Applications; Nov2025, Vol. 92 Issue 2, p515-527, 13p |
| Database: | Applied Science & Technology Source |
| ISSN: | 09266003 |
|---|---|
| DOI: | 10.1007/s10589-025-00709-5 |
