- Title
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- Creator
- Bauschke, Heinz H.; Dao, Minh H.
- Relation
- SIAM Journal on Optimization Vol. 27, Issue 1, p. 507-537
- Publisher Link
- http://dx.doi.org/10.1137/16M1071079
- Publisher
- Society for Industrial and Applied Mathematics
- Resource Type
- journal article
- Date
- 2017
- Description
- Solving feasibility problems is a central task in mathematics and the applied sciences. One particularly successful method is the Douglas-Rachford algorithm. In this paper, we provide many new conditions sufficient for finite convergence. Numerous examples illustrate our results.
- Subject
- averaged alternating reflections; epigraph; global convergence; halfspaces
- Identifier
- http://hdl.handle.net/1959.13/1399930
- Identifier
- uon:34706
- Identifier
- ISSN:1052-6234
- Rights
- First Published in SIAM Journal on Optimization in Vol. 27, No.1, published by the Society for Industrial and Applied Mathematics (SIAM). Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
- Language
- eng
- Full Text
- Reviewed
- Hits: 1734
- Visitors: 1834
- Downloads: 155
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Publisher version (open access) | 2 MB | Adobe Acrobat PDF | View Details Download |