Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem

Title: Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
Creator: Aragón Artacho, Franciso J.; Borwein, Jonathan M.; Tam, Matthew K.
Relation: Journal of Global Optimization Vol. 65, Issue 2, p. 309-327
Publisher Link: http://dx.doi.org/10.1007/s10898-015-0380-6
Publisher: Springer
Resource Type: journal article
Date: 2016
Description: In recent times the Douglas-Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a point in the intersection of a half-space and a potentially non-convex set which is assumed to satisfy a well-quasi-ordering property or a property weaker than compactness. In particular, the special case in which the second set is finite is covered by our framework and provides a prototypical setting for combinatorial optimization problems.
Subject: Douglas–Rachford algorithm; global convergence; feasibility problem; half-space; non-convex
Identifier: http://hdl.handle.net/1959.13/1320081
Identifier: uon:24058
Identifier: ISSN:0925-5001
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format