23 citations · 58 across the 14 of their papers we have counts for
3 papers · 1 filter
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…
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…