4 citations · 6 across the 4 of their papers we have counts for
4 papers
Coderivative-Based Semi-Newton Method in Nonsmooth Difference Programming
Francisco J. Aragón-Artacho, Boris S. Mordukhovich, Pedro Pérez-Aros
This paper addresses the study of a new class of nonsmooth optimization problems, where the objective is represented as a difference of two generally nonconvex functions. We propos…
The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
Francisco J. Aragón-Artacho, Yair Censor, Aviv Gibali +1
In this paper we study the split minimization problem that consists of two constrained minimization problems in two separate spaces that are connected via a linear operator that ma…
The Boosted DC Algorithm for linearly constrained DC programming
Francisco J. Aragón Artacho, Rubén Campoy, Phan T. Vuong
The Boosted Difference of Convex functions Algorithm (BDCA) has been recently introduced to accelerate the performance of the classical Difference of Convex functions Algorithm (DC…
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…