A Cyclic Douglas–Rachford Iteration Scheme
A Cyclic Douglas–Rachford Iteration Scheme
About this item
Full title
Author / Creator
Publisher
Boston: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
Boston: Springer US
Subjects
More information
Scope and Contents
Contents
In this paper, we present two Douglas–Rachford inspired iteration schemes which can be applied directly to
N
-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the
N
sets coincide. For affine subspaces, convergence is in norm. In...
Alternative Titles
Full title
A Cyclic Douglas–Rachford Iteration Scheme
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1671408550
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1671408550
Other Identifiers
ISSN
0022-3239
E-ISSN
1573-2878
DOI
10.1007/s10957-013-0381-x