Convergence analysis for proximal gradient-type methods with arbitrary proximal terms in nonconvex composite optimization, without requiring the global descent property between the smooth function and its proximal mapping.
Dc formulations and algorithms for sparse optimization problems.Mathematical Programming, 169(1):141–176, 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Proximal gradient-type method with generalized distance and convergence analysis without global descent lemma
Convergence analysis for proximal gradient-type methods with arbitrary proximal terms in nonconvex composite optimization, without requiring the global descent property between the smooth function and its proximal mapping.