5 papers
Strengthened Splitting Methods for Computing Resolvents
Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam
In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in the sum individually.…
Demiclosedness principles for generalized nonexpansive mappings
Sedi Bartz, Rubén Campoy, Hung M. Phan
Demiclosedness principles are powerful tools in the study of convergence of iterative methods. For instance, a multi-operator demiclosedness principle for firmly nonexpansive mappi…
Using positive spanning sets to achieve d-stationarity with the Boosted DC Algorithm
Francisco J. Aragón Artacho, Rubén Campoy, Phan T. Vuong
The Difference of Convex functions Algorithm (DCA) is widely used for minimizing the difference of two convex functions. A recently proposed accelerated version, termed BDCA for Bo…
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…
An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
F. J. Aragón Artacho, R. Campoy, V. Elser
We study the behavior of the Douglas-Rachford algorithm on the graph vertex-coloring problem. Given a graph and a number of colors, the goal is to find a coloring of the vertices s…