4 citations · 7 across the 2 of their papers we have counts for
3 papers
math.OC2020★ 3 cited
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions
Coralia Cartis, Nick Gould, Philippe L. Toint
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and…
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.OC2017★ 4 cited
Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure
Coralia Cartis, Nick Gould, Philippe L Toint
Evaluation complexity for convexly constrained optimization is considered and it is shown first that the complexity bound of proved by Cartis, Gould and Toint (IMAJNA…