Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space (Q6113524): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:19, 10 July 2024
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
