Antzeko izenburuak

• Examples of slow convergence for adaptive regularization optimization methods are not isolated
  nork: Toint, Philippe L.
  Argitaratua: (2024)
• Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
  nork: Gratton, Serge, et al.
  Argitaratua: (2026)
• A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
  nork: Gratton, Serge, et al.
  Argitaratua: (2024)
• Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
  nork: Gratton, Serge, et al.
  Argitaratua: (2024)
• Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
  nork: Gratton, Serge, et al.
  Argitaratua: (2025)