Preprint
Aug 2026
Variable Smoothing for Weakly Convex Problems with Non-Euclidean Directions
An algorithm for composite optimization problems of the form min x f (x) + g(T x), where f is smooth and g may be non-smooth is proposed, which leverages the Moreau envelope to smooth the non-smooth component while adapting to problem geometry through linear minimization oracles.
Farid Najar
· 0 citations