Adaptive First-Order Methods Revisited: Convex Optimization without Lipschitz Requirements

We propose a new family of adaptive first-order methods for a class of convex minimization problems that may fail to be Lipschitz continuous or smooth.