Updating the regularization parameter in the adaptive cubic regularization algorithm

Research output: Contribution to journal › Article › peer-review

184 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
2020
Adaptive regularization algorithms with inexact evaluations for nonconvex optimization
Bellavia, S., Gurioli, G., Morini, B. & Toint, P., 2 Jan 2020, In: SIAM Journal on Optimization. 29, 4, p. 2881-2915 35 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
112 Downloads (Pure)
2018
Second-order optimality and beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization
Cartis, C., Gould, N. I. M. & Toint, P., 1 Oct 2018, In: Foundations of Computational Mathematics. 18, 5, p. 1073-1107 35 p.
Research output: Contribution to journal › Article › peer-review

Open Access
2017
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
Toint, P., 2 Nov 2017, In: Optimization Methods and Software. 32, 6, p. 1273-1298 26 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
84 Downloads (Pure)
2013
An example of slow convergence for Newton's method on a function with globally Lipschitz continuous Hessian
Cartis, C., Gould, N. I. M. & Toint, P., 5 May 2013, Namur center for complex systems, 9 p.
Research output: Working paper

File
157 Downloads (Pure)

Research output