arXiv:1608.02240 [math.OC]AbstractReferencesReviewsResources
The forward-backward algorithm and the normal problem
Published 2016-08-07Version 1
The forward-backward splitting technique is a popular method for solving monotone inclusions that has applications in optimization. In this paper we explore the behaviour of the algorithm when the inclusion problem has no solution. We present a new formula to define the normal solutions using the forward-backward operator. We also provide a formula for the range of the displacement map of the forward-backward operator. Several examples illustrate our theory.
Related articles: Most relevant | Search more
arXiv:2406.03309 [math.OC] (Published 2024-06-05)
Forward-backward algorithms devised by graphs
arXiv:1505.02796 [math.OC] (Published 2015-05-11)
On the order of the operators in the Douglas-Rachford algorithm
arXiv:1912.13165 [math.OC] (Published 2019-12-31)
On compositions of special cases of Lipschitz continuous operators