Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $$o(\epsilon ^{-2})$$ rather than $$\mathcal{O}(\epsilon ^{-2})$$
S. Gratton, C.-K. Sim, Ph. L. Toint. Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $$o(\epsilon ^{-2})$$ rather than $$\mathcal{O}(\epsilon ^{-2})$$. // Computational Optimization and Applications. – 2025. – DOI: 10.1007/s10589-025-00709-5. – URL: https://doi.org/10.1007/s10589-025-00709-5
S. Gratton, C.-K. Sim, & Ph. L. Toint (2025). Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $$o(\epsilon ^{-2})$$ rather than $$\mathcal{O}(\epsilon ^{-2})$$. Computational Optimization and Applications. https://doi.org/10.1007/s10589-025-00709-5
S. Gratton, et al. “Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $$o(\epsilon ^{-2})$$ rather than $$\mathcal{O}(\epsilon ^{-2})$$.” Computational Optimization and Applications, 2025. doi:10.1007/s10589-025-00709-5.
@article{Gratton2025,
title = {Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is \$\$o(\epsilon ^\{-2\})\$\$ rather than \$\$\mathcal\{O\}(\epsilon ^\{-2\})\$\$},
author = {Gratton, S. and Sim, C.-K. and Toint, Ph. L.},
journal = {Computational Optimization and Applications},
year = {2025},
doi = {10.1007/s10589-025-00709-5},
url = {https://doi.org/10.1007/s10589-025-00709-5}
}