Prefer a chat interface with context about you and your work?
Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds and convex constraints
A parametric class of trust-region algorithms for constrained nonconvex optimization is analyzed, where the objective function is never computed. By defining appropriate first-order stationarity criteria, we are able to extend the Adagrad method to the newly considered problem and retrieve the standard complexity rate of the projected gradient method that …