Optimal Gradient-Norm Minimization in Non-Euclidean H\"older-Smooth Convex Optimization
Minimizing gradients of a convex function is an important problem across optimization and learning tasks. The gradient provides a directly computable certificate of approximate stationarity, and its minimization usually implies stronger results than those for minimization of function values. In this work, we study grad...