Document is current

Any future updates will be listed below

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $$o(\epsilon ^{-2})$$ rather than $$\mathcal{O}(\epsilon ^{-2})$$

Crossref DOI link: https://doi.org/10.1007/s10589-025-00709-5

Published Online: 2025-07-24

Published Print: 2025-11

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark