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

Research output: Working paper

65 Downloads (Pure)

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
An adaptive regularization method in Banach spaces
Gratton, S., Jerad, S. & Toint, P. L., 24 Nov 2023, In: Optimization Methods and Software. 38, 6, p. 1163-1179 17 p.
Research output: Contribution to journal › Article › peer-review

File
26 Downloads (Pure)
The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case
Bellavia, S., Gurioli, G., Morini, B. & TOINT, P., Feb 2023, In: Journal of Optimization Theory and Applications. 196, 2, p. 700-729 30 p.
Research output: Contribution to journal › Article › peer-review
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)
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
Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques
Bellavia, S., Gurioli, G., Morini, B. & Toint, P. L., Jan 2022, In: EURO Journal on Computational Optimization. 10, 100043.
Research output: Contribution to journal › Article › peer-review

Open Access
File
10 Downloads (Pure)

Research output