Search results
-
2025
Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(eps^{-2}) rather than O(eps^{-2})
Gratton, S., Sim, C. & Toint, P., Nov 2025, In: Computational Optimization and Applications. 92, 2, p. 515-527 13 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile29 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
File75 Downloads (Pure) -
Convergence properties of an Objective-Function-Free Optimization regularization algorithm, including an 0(epsilon^{-3/2}) complexity bound
Gratton, S., Jerad, S. & TOINT, P., Feb 2023, In: SIAM Journal on Optimization. 33, 3, p. 1621-1646Research output: Contribution to journal › Article › peer-review
File25 Downloads (Pure) -
2017
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Birgin, E. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A. & Toint, P. L., 15 Apr 2017, In: Mathematical Programming. 163, 1-2, p. 359-368 10 p.Research output: Contribution to journal › Article › peer-review
Open Access -
2011
Adaptive cubic regularisation methods for unconstrained optimization. Part II: Worst-case function- and derivative-evaluation complexity
Cartis, C., Gould, N. & Toint, P., 1 Dec 2011, In: Mathematical Programming. 130, 2, p. 295-319 25 p.Research output: Contribution to journal › Article › peer-review
File248 Downloads (Pure)