Adaptive, linesearch-free Bregman proximal gradient algorithms are proven convergent under only local relative smoothness, via a new Bregman-Young inequality.
Libsvm: A library for support vector machines
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
background 1representative citing papers
citing papers explorer
-
Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness
Adaptive, linesearch-free Bregman proximal gradient algorithms are proven convergent under only local relative smoothness, via a new Bregman-Young inequality.