2 papers
math.OC2026
A Smooth Approximation Framework for Weakly Convex Optimization
Qi Deng, Wenzhi Gao
Standard complexity analyses for weakly convex optimization rely on the Moreau envelope technique proposed by Davis and Drusvyatskiy (2019). The main insight is that nonsmooth algo…
math.OC2025
Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
Yijin Ren, Haifeng Xu, Qi Deng
This paper introduces new parameter-free first-order methods for convex optimization problems in which the objective function exhibits Hölder smoothness. Inspired by the recently…