Publicaciones en colaboración con investigadores/as de Universitat d'Alacant (13)

2023

  1. Regularity of Sets Under a Reformulation in a Product Space with Reduced Dimension

    Set-Valued and Variational Analysis, Vol. 31, Núm. 4

2022

  1. The Boosted DC Algorithm for Linearly Constrained DC Programming

    Set-Valued and Variational Analysis, Vol. 30, Núm. 4, pp. 1265-1289

2021

  1. Strengthened splitting methods for computing resolvents

    Computational Optimization and Applications, Vol. 80, Núm. 2, pp. 549-585

2020

  1. An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm

    Journal of Global Optimization, Vol. 77, Núm. 2, pp. 383-403

  2. Correction to: Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm (Vietnam Journal of Mathematics, (2020), 48, 2, (363-376), 10.1007/s10013-020-00400-8)

    Vietnam Journal of Mathematics

  3. Entornos de aprendizaje para Geometría en 3D

    Memòries del Programa de Xarxes-I3CE de qualitat, innovació i investigació en docència universitària: Convocatòria 2019-20 (Instituto de Ciencias de la Educación), pp. 405-408

  4. The Douglas–Rachford algorithm for convex and nonconvex feasibility problems

    Mathematical Methods of Operations Research, Vol. 91, Núm. 2, pp. 201-240

  5. Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm

    Vietnam Journal of Mathematics, Vol. 48, Núm. 2, pp. 363-376

2019

  1. Computing the Resolvent of the Sum of Maximally Monotone Operators with the Averaged Alternating Modified Reflections Algorithm

    Journal of Optimization Theory and Applications, Vol. 181, Núm. 3, pp. 709-726

  2. Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces

    Numerical Algorithms, Vol. 82, Núm. 2, pp. 397-421

2018

  1. A feasibility approach for constructing combinatorial designs of circulant type

    Journal of Combinatorial Optimization, Vol. 35, Núm. 4, pp. 1061-1085

  2. A new projection method for finding the closest point in the intersection of convex sets

    Computational Optimization and Applications, Vol. 69, Núm. 1, pp. 99-132

  3. Solving Graph Coloring Problems with the Douglas-Rachford Algorithm

    Set-Valued and Variational Analysis, Vol. 26, Núm. 2, pp. 277-304