Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space (Q6113524)
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: Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space |
scientific article; zbMATH DE number 7724375
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space |
scientific article; zbMATH DE number 7724375 |
Statements
Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space (English)
0 references
9 August 2023
0 references
convex feasibility problem
0 references
common fixed point problem
0 references
Douglas-Rachford algorithm
0 references
iterative method
0 references
strongly nonexpansive operator
0 references
unrestricted product
0 references
0 references
0 references
0 references
0 references
