17 citations · 84 across the 29 of their papers we have counts for
3 papers · 1 filter
Universal regularization methods - varying the power, the smoothness and the accuracy
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Adaptive cubic regularization methods have emerged as a credible alternative to linesearch and trust-region for smooth nonconvex optimization, with optimal complexity amongst secon…
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e.\ problems where the cost of evaluating/enfor…
Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
S. Bellavia, G. Gurioli, B. Morini +1
A regularization algorithm using inexact function values and inexact derivatives is proposed and its evaluation complexity analyzed. This algorithm is applicable to unconstrained p…