| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142145 | Operations Research Letters | 2016 | 4 Pages |
Abstract
The Douglas–Rachford algorithm is a simple yet effective method for solving convex feasibility problems. However, if the underlying constraints are inconsistent, then the convergence theory is incomplete. We provide convergence results when one constraint is an affine subspace. As a consequence, we extend a result by Spingarn from halfspaces to general closed convex sets admitting least-squares solutions.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Heinz H. Bauschke, Minh N. Dao, Walaa M. Moursi,