Rubén Campoy

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
A comparative numerical study of graph-based splitting algorithms for linear subspaces.
CoRR
Francisco J. Aragón Artacho, Rubén Campoy, Irene López-Larios, César López-Pastor
2025 J jnl
Forward-Backward Algorithms Devised by Graphs.
SIAM J. Optim.
Francisco J. Aragón Artacho, Rubén Campoy, César López-Pastor
2025 J jnl
Nonmonotone subgradient methods based on a local descent lemma.
CoRR
Francisco J. Aragón Artacho, Rubén Campoy, Pedro Pérez-Aros, David Torregrosa-Belén
2022 J jnl
A product space reformulation with reduced dimension for splitting algorithms.
Comput. Optim. Appl.
Rubén Campoy
2022 J jnl
An Adaptive Alternating Direction Method of Multipliers.
J. Optim. Theory Appl.
Sedi Bartz, Rubén Campoy, Hung M. Phan
2021 J jnl
Strengthened splitting methods for computing resolvents.
Comput. Optim. Appl.
Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam
2020 J jnl
An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm.
J. Glob. Optim.
Francisco J. Aragón Artacho, Rubén Campoy, Veit Elser
2020 J jnl
Demiclosedness Principles for Generalized Nonexpansive Mappings.
J. Optim. Theory Appl.
Sedi Bartz, Rubén Campoy, Hung M. Phan
2020 J jnl
The Douglas-Rachford algorithm for convex and nonconvex feasibility problems.
Math. Methods Oper. Res.
Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam
2019 J jnl
Computing the Resolvent of the Sum of Maximally Monotone Operators with the Averaged Alternating Modified Reflections Algorithm.
J. Optim. Theory Appl.
Francisco J. Aragón Artacho, Rubén Campoy
2019 J jnl
Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces.
Numer. Algorithms
Francisco J. Aragón Artacho, Rubén Campoy
2019 J jnl
Using positive spanning sets to achieve stationarity with the Boosted DC Algorithm.
CoRR
Francisco J. Aragón Artacho, Rubén Campoy, Quoc Tran-Dinh, Phan Tu Vuong
2018 J jnl
A feasibility approach for constructing combinatorial designs of circulant type.
J. Comb. Optim.
Francisco J. Aragón Artacho, Rubén Campoy, Ilias S. Kotsireas, Matthew K. Tam
2018 J jnl
A new projection method for finding the closest point in the intersection of convex sets.
Comput. Optim. Appl.
Francisco J. Aragón Artacho, Rubén Campoy