Forward-Backward Splitting with Bregman Distances
Optimization and Control
2016-10-10 v2
Abstract
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.
Cite
@article{arxiv.1505.05198,
title = {Forward-Backward Splitting with Bregman Distances},
author = {Quang Van Nguyen},
journal= {arXiv preprint arXiv:1505.05198},
year = {2016}
}