A convergent relaxation of the Douglas-Rachford algorithm (Q721957)
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: A convergent relaxation of the Douglas-Rachford algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convergent relaxation of the Douglas-Rachford algorithm |
scientific article |
Statements
A convergent relaxation of the Douglas-Rachford algorithm (English)
0 references
20 July 2018
0 references
almost averagedness
0 references
Picard iteration
0 references
alternating projection method
0 references
Douglas-Rachford method
0 references
RAAR algorithm
0 references
Krasnoselski-Mann relaxation
0 references
metric subregularity
0 references
transversality
0 references
collection of sets
0 references
0 references
0 references
0 references
0.9595725
0 references
0.9235108
0 references
0.91878915
0 references
0.91854435
0 references
0.91486835
0 references
0.91287625
0 references
0 references
0.9096041
0 references
0.90894437
0 references
0.9085437
0 references
