The Douglas–Rachford algorithm for convex and nonconvex feasibility problems

The Douglas–Rachford algorithm is an optimization method that can be used for solving feasibility problems. To apply the method, it is necessary that the problem at hand is prescribed in terms of constraint sets having efficiently computable nearest points. Although the convergence of the algorithm...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical methods of operations research (Heidelberg, Germany) Vol. 91; no. 2; pp. 201 - 240
Main Authors:	Aragón Artacho, Francisco J., Campoy, Rubén, Tam, Matthew K.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2020 Springer Nature B.V
Subjects:	Algorithms Business and Management Calculus of Variations and Optimal Control; Optimization Combinatorial analysis Convergence Feasibility Mathematics Mathematics and Statistics Operations research Operations Research/Decision Theory Optimization Original Article 65K05 Projection methods Douglas–Rachford Eight queens problem 90C27 Feasibility problem 90-01 65-01
ISSN:	1432-2994, 1432-5217
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!