On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections (Q2228383)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7311800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections |
scientific article; zbMATH DE number 7311800 |
Statements
On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections (English)
0 references
17 February 2021
0 references
The authors provide sufficient conditions for a rapid convergence of Dykstra's algorithm which finds the projection onto the intersection of two closed convex subsets in a Hilbert space. The behaviour of Dykstra's algorithm is verified on a set of a line and a square. The authors show that Dykstra's algorithm may stall for an arbitrarily long time. Finally, they present some open problems.
0 references
convex set
0 references
Dykstra's algorithm
0 references
method of alternating projections
0 references
projection
0 references
0.8969362
0 references
0.89006126
0 references
0.8769449
0 references
0.87572646
0 references
0.8682451
0 references
0.86637104
0 references
