2 papers
math.OC2026
Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
Serge Gratton, Philippe L. Toint
We propose a simple proof of the worst-case iteration complexity for the Difference of Convex functions Algorithm (DCA) for unconstrained minimization, showing that the global rate…
math.OC2025
Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
Serge Gratton, Alena Kopaničáková, Philippe Toint
Two OFFO (Objective-Function Free Optimization) noise tolerant algorithms are presented that handle bound constraints, inexact gradients and use second-order information when avail…