The DC programming and its DC algorithm (DCA) address the problem of minimizing a
function f= g− h (with g, h being lower semicontinuous proper convex functions on R n) on
the whole space. Based on local optimality conditions and DC duality, DCA was successfully
applied to a lot of different and various nondifferentiable nonconvex optimization problems
to which it quite often gave global solutions and proved to be more robust and more efficient
than related standard methods, especially in the large scale setting. The computational …

The DC (difference of convex functions) Programming and DCA revisited with DC models of
real world nonconvex optimization problems - Université de Lorraine … À paraître (true ou
false) … Projet ANR : Acronyme du programme …