A new projection method for finding the closest point in the intersection of convex sets. - Francisco J. Aragón Artacho; Rubén Campoy (Comput. Optim. Appl., 2018)

A feasibility approach for constructing combinatorial designs of circulant type. - Francisco J. Aragón Artacho; Rubén Campoy; Ilias S. Kotsireas; Matthew K. Tam (J. Comb. Optim., 2018)

Using positive spanning sets to achieve stationarity with the Boosted DC Algorithm. - Francisco J. Aragón Artacho; Rubén Campoy; Quoc Tran-Dinh; Phan Tu Vuong (CoRR, 2019)

Computing the Resolvent of the Sum of Maximally Monotone Operators with the Averaged Alternating Modified Reflections Algorithm. - Francisco J. Aragón Artacho; Rubén Campoy (J. Optim. Theory Appl., 2019)

Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces. - Francisco J. Aragón Artacho; Rubén Campoy (Numer. Algorithms, 2019)

An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm. - Francisco J. Aragón Artacho; Rubén Campoy; Veit Elser (J. Glob. Optim., 2020)

Demiclosedness Principles for Generalized Nonexpansive Mappings. - Sedi Bartz; Rubén Campoy; Hung M. Phan (J. Optim. Theory Appl., 2020)

The Douglas-Rachford algorithm for convex and nonconvex feasibility problems. - Francisco J. Aragón Artacho; Rubén Campoy; Matthew K. Tam (Math. Methods Oper. Res., 2020)

Strengthened splitting methods for computing resolvents. - Francisco J. Aragón Artacho; Rubén Campoy; Matthew K. Tam (Comput. Optim. Appl., 2021)

A product space reformulation with reduced dimension for splitting algorithms. - Rubén Campoy (Comput. Optim. Appl., 2022)

An Adaptive Alternating Direction Method of Multipliers. - Sedi Bartz; Rubén Campoy; Hung M. Phan (J. Optim. Theory Appl., 2022)