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

Research output

Research output per year 2022 2022 2023 2024

• 3 Article
• 2 Working paper
• 1 Book

Research output per year

Research output per year

Search results

• 2022

  Evaluation complexity of algorithms for nonconvex optimization

  Cartis, C., Gould, N. I. M. & TOINT, P., Jul 2022, SIAM. 600 p. (SIAM-MOS Series on Optimization)

  Research output: Book/Report/Journal › Book