A unified framework using scaled Kurdyka-Lojasiewicz inequalities shows that Bregman proximal point and gradient methods, and mirror flow, converge for closed-domain separable kernels and subanalytic or definable objectives.
Hessian Riemannian gradient flows in convex programming.SIAM Journal on Control and Optimization, 43:477–501, 2018
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
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Unified Framework for Iterate Convergence of Bregman Proximal Methods
A unified framework using scaled Kurdyka-Lojasiewicz inequalities shows that Bregman proximal point and gradient methods, and mirror flow, converge for closed-domain separable kernels and subanalytic or definable objectives.