ItsDEAL provides an inexact two-level smoothing gradient-descent framework for weakly convex optimization, with subsequential convergence to proximal fixed points and linear rates under a Kurdyka-Lojasiewicz condition.
Mathematical Programming 208:365–407
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
ItsDEAL provides an inexact two-level smoothing gradient-descent framework for weakly convex optimization, with subsequential convergence to proximal fixed points and linear rates under a Kurdyka-Lojasiewicz condition.