1 citations · 1 across the 9 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.OC2024★ 1 cited
A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
Serge Gratton, Sadok Jerad, Philippe L. Toint
A fully stochastic second-order adaptive-regularization method for unconstrained nonconvex optimization is presented which never computes the objective-function value, but yet achi…
math.OC2024
Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
Serge Gratton, Sadok Jerad, Philippe L. Toint
A parametric class of trust-region algorithms for constrained nonconvex optimization is analyzed, where the objective function is never computed. By defining appropriate first-orde…