6 citations · 14 across the 20 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.OC2022
OFFO minimization algorithms for second-order optimality and their complexity
S. Gratton, Ph. L. Toint
An Adagrad-inspired class of algorithms for smooth unconstrained optimization is presented in which the objective function is never evaluated and yet the gradient norms decrease at…
math.OC2022★ 2 cited
Complexity and performance for two classes of noise-tolerant first-order algorithms
S. Gratton, S. Jerad, Ph. L. Toint
Two classes of algorithms for optimization in the presence of noise are presented, that do not require the evaluation of the objective function. The first generalizes the well-know…
math.OC2022★ 2 cited
Complexity of a Class of First-Order Objective-Function-Free Optimization Algorithms
S. Gratton, S. Jerad, Ph. L. Toint
A parametric class of trust-region algorithms for unconstrained nonconvex optimization is considered where the value of the objective function is never computed. The class contains…