Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions (Q2322832)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions |
scientific article; zbMATH DE number 7101812
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions |
scientific article; zbMATH DE number 7101812 |
Statements
Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions (English)
0 references
5 September 2019
0 references
inexact Douglas-Rachford method
0 references
splitting
0 references
monotone operators
0 references
HPE method
0 references
complexity
0 references
Tseng's forward-backward method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.87899435
0 references
0.87639916
0 references
0.87504905
0 references
0 references
0.8689024
0 references
0.86847234
0 references
0.8654728
0 references
0.8634565
0 references
