17 citations · 27 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.OC2018
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…
math.OC2018
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…