| Issue |
ESAIM: COCV
Volume 25, 2019
|
|
|---|---|---|
| Article Number | 57 | |
| Number of page(s) | 14 | |
| DOI | https://doi.org/10.1051/cocv/2018063 | |
| Published online | 25 October 2019 | |
A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance*
IMPA, Estrada Dona Castorina 110,
22460-320
Rio de Janeiro, Brazil.
** Corresponding author: benar@impa.br
Received:
8
September
2018
Accepted:
5
November
2018
Douglas-Rachford method is a splitting algorithm for finding a zero of the sum of two maximal monotone operators. Each of its iterations requires the sequential solution of two proximal subproblems. The aim of this work is to present a fully inexact version of Douglas-Rachford method wherein both proximal subproblems are solved approximately within a relative error tolerance. We also present a semi-inexact variant in which the first subproblem is solved exactly and the second one inexactly. We prove that both methods generate sequences weakly convergent to the solution of the underlying inclusion problem, if any.
Mathematics Subject Classification: 49M27 / 47H05 / 65G99 / 65K05 / 49J45
Key words: Douglas - Rachford method / relative error / weak convergence / splitting
© EDP Sciences, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.