6 citations · 14 across the 20 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.OC2023
An optimally fast objective-function-free minimization algorithm using random subspaces
S. Bellavia, S. Gratton, B. Morini +1
An algorithm for unconstrained non-convex optimization is described, which does not evaluate the objective function and in which minimization is carried out, at each iteration, wit…
cs.LG2023
Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example
Ph. L. Toint
A very simple unidimensional function with Lipschitz continuous gradient is constructed such that the ADAM algorithm with constant stepsize, started from the origin, diverges when…