On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232)
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: On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces |
scientific article; zbMATH DE number 6584560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces |
scientific article; zbMATH DE number 6584560 |
Statements
On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (English)
0 references
25 May 2016
0 references
alternating projections
0 references
convex feasibility problem
0 references
convex set
0 references
Douglas-Rachford algorithm
0 references
epigraph
0 references
finite convergence
0 references
method of reflection-projection
0 references
monotone operator
0 references
partial inverse
0 references
polyhedral set
0 references
projector
0 references
Slater's condition
0 references
0 references
0 references
0 references
0 references
0.9010109305381776
0 references
0.8451212644577026
0 references
0.8448666334152222
0 references
0.8396046757698059
0 references
0.8381288051605225
0 references
