Back to Search
Start Over
The Douglas-Rachford algorithm in the affine-convex case
- Source :
- Operations Research Letters, 44(3):379--382, 2016
- Publication Year :
- 2015
-
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.
- Subjects :
- Mathematics - Optimization and Control
Mathematics - Numerical Analysis
Subjects
Details
- Database :
- arXiv
- Journal :
- Operations Research Letters, 44(3):379--382, 2016
- Publication Type :
- Report
- Accession number :
- edsarx.1505.06408
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1016/j.orl.2016.03.010