3 citations · 4 across the 8 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.OC2019
The Douglas-Rachford Algorithm for Convex and Nonconvex Feasibility Problems
Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam
The Douglas-Rachford method, a projection algorithm designed to solve continuous optimization problems, forms the basis of a useful heuristic for solving combinatorial optimization…
math.OC2019
Shadow Douglas--Rachford Splitting for Monotone Inclusions
Ernö Robert Csetnek, Yura Malitsky, Matthew K. Tam
In this work, we propose a new algorithm for finding a zero in the sum of two monotone operators where one is assumed to be single-valued and Lipschitz continuous. This algorithm n…