arXiv Analytics

Sign in

arXiv:1505.05198 [math.OC]AbstractReferencesReviewsResources

Forward-Backward Splitting with Bregman Distances

Quang Van Nguyen

Published 2015-05-19Version 1

We propose a forward-backward splitting algorithm based on Bregman distances for composite minimization problems in general reflexive Banach spaces. The convergence is established using the notion of variable quasi-Bregman monotone sequences. Various examples are discussed, including some in Euclidean spaces, where new algorithms are obtained.

Related articles: Most relevant | Search more
arXiv:2112.00776 [math.OC] (Published 2021-12-01, updated 2022-08-12)
Forward--Backward Splitting with Deviations for Monotone Inclusions
arXiv:2208.05498 [math.OC] (Published 2022-08-10)
Incorporating History and Deviations in Forward--Backward Splitting
arXiv:1507.07095 [math.OC] (Published 2015-07-25)
Stochastic Approximations and Perturbations in Forward-Backward Splitting for Monotone Operators