Recent advances in DC programming and DCA
T Pham Dinh, HA Le Thi - Transactions on computational intelligence XIII, 2014 - Springer
Difference of Convex functions (DC) Programming and DC Algorithm (DCA) constitute the
backbone of Nonconvex Programming and Global Optimization. The paper is devoted to the …
backbone of Nonconvex Programming and Global Optimization. The paper is devoted to the …
DC programming and DCA: thirty years of developments
HA Le Thi, T Pham Dinh - Mathematical Programming, 2018 - Springer
The year 2015 marks the 30th birthday of DC (Difference of Convex functions) programming
and DCA (DC Algorithms) which constitute the backbone of nonconvex programming and …
and DCA (DC Algorithms) which constitute the backbone of nonconvex programming and …
Open issues and recent advances in DC programming and DCA
HA Le Thi, T Pham Dinh - Journal of Global Optimization, 2024 - Springer
DC (difference of convex functions) programming and DC algorithm (DCA) are powerful
tools for nonsmooth nonconvex optimization. This field was created in 1985 by Pham Dinh …
tools for nonsmooth nonconvex optimization. This field was created in 1985 by Pham Dinh …
DC approximation approaches for sparse optimization
Sparse optimization refers to an optimization problem involving the zero-norm in objective or
constraints. In this paper, nonconvex approximation approaches for sparse optimization …
constraints. In this paper, nonconvex approximation approaches for sparse optimization …
On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
Natural image statistics indicate that we should use nonconvex norms for most
regularization tasks in image processing and computer vision. Still, they are rarely used in …
regularization tasks in image processing and computer vision. Still, they are rarely used in …
The boosted difference of convex functions algorithm for nonsmooth functions
FJ Aragón Artacho, PT Vuong - SIAM Journal on Optimization, 2020 - SIAM
The boosted difference of convex functions algorithm (BDCA) was recently proposed for
minimizing smooth difference of convex (DC) functions. BDCA accelerates the convergence …
minimizing smooth difference of convex (DC) functions. BDCA accelerates the convergence …
Composite difference-max programs for modern statistical estimation problems
Many modern statistical estimation problems are defined by three major components: a
statistical model that postulates the dependence of an output variable on the input features; …
statistical model that postulates the dependence of an output variable on the input features; …
DC programming and DCA for general DC programs
We present a natural extension of DC programming and DCA for modeling and solving
general DC programs with DC constraints. Two resulting approaches consist in …
general DC programs with DC constraints. Two resulting approaches consist in …
Accelerating the DC algorithm for smooth functions
We introduce two new algorithms to minimise smooth difference of convex (DC) functions
that accelerate the convergence of the classical DC algorithm (DCA). We prove that the point …
that accelerate the convergence of the classical DC algorithm (DCA). We prove that the point …