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

Serge Gratton, Chee_Khian Sim, Philippe Toint

Namur Institute for Complex Systems

Research output: Working paper

65 Downloads (Pure)

3 Article
2 Working paper
1 Book

2 results

Filter

2024
Examples of slow convergence for adaptive regularization optimization methods are not isolated
Toint, P., 25 Sept 2024, Arxiv.
Research output: Working paper

File
25 Downloads (Pure)
2023
Yet another fast variant of Newton's method for nonconvex optimization
Gratton, S., Jerad, S. & TOINT, P., 21 Feb 2023, Arxiv, 26 p.
Research output: Working paper

File
41 Downloads (Pure)