Global convergence of a non-convex Douglas–Rachford iteration

Francisco Aragón Artacho () and Jonathan Borwein ()

Journal of Global Optimization, 2013, vol. 57, issue 3, 753-769

Abstract: We establish a region of convergence for the proto-typical non-convex Douglas–Rachford iteration which finds a point on the intersection of a line and a circle. Previous work on the non-convex iteration Borwein and Sims (Fixed-point algorithms for inverse problems in science and engineering, pp. 93–109, 2011 ) was only able to establish local convergence, and was ineffective in that no explicit region of convergence could be given. Copyright Springer Science+Business Media, LLC. 2013

Keywords: Non-convex feasibility problem; Fixed point theory; Projection algorithm; Douglas–Rachford algorithm; Global convergence; Signal reconstruction (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-012-9958-4 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:57:y:2013:i:3:p:753-769

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-012-9958-4

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().