The authors propose Bregman Itoh–Abe discrete gradient methods, prove that their iterates converge to Clarke stationary points under box constraints, and demonstrate faster convergence on sparse linear systems and denoising.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Bregman Itoh--Abe methods for sparse optimisation
The authors propose Bregman Itoh–Abe discrete gradient methods, prove that their iterates converge to Clarke stationary points under box constraints, and demonstrate faster convergence on sparse linear systems and denoising.