3 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
Convergence properties of an Objective-Function-Free Optimization regularization algorithm, including an complexity bound
S. Gratton, S. Jerad, Ph. L. Toint
An adaptive regularization algorithm for unconstrained nonconvex optimization is presented in which the objective function is never evaluated, but only derivatives are used. This a…
Adaptive Regularization Minimization Algorithms with Non-Smooth Norms and Euclidean Curvature
Serge Gratton, Philippe L. Toint
A regularization algorithm (AR1pGN) for unconstrained nonlinear minimization is considered, which uses a model consisting of a Taylor expansion of arbitrary degree and regularizati…
Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
S. Gratton, E. Simon, Ph. L. Toint
An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that…
A Line-Search Algorithm Inspired by the Adaptive Cubic Regularization Framework and Complexity Analysis
El houcine Bergou, Youssef Diouane, Serge Gratton
Adaptive regularized framework using cubics has emerged as an alternative to line-search and trust-region algorithms for smooth nonconvex optimization, with an optimal complexity a…