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 …

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 …

We investigate the convex–concave procedure, a local heuristic that utilizes the tools of
convex optimization to find local optima of difference of convex (DC) programming problems …

5G New Radio (NR) is envisioned to efficiently support both enhanced mobile broadband
(eMBB) and ultra-reliable low-latency communication (URLLC). Due to the severe constraint …

Virtual reality (VR) over wireless is emerging as an important use case of 5G networks. Fully-
immersive VR experience requires the wireless delivery of huge data at ultra-low latency …

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 …

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 …

We propose a DC (Difference of two Convex functions) formulation approach for sparse
optimization problems having a cardinality or rank constraint. With the largest-k norm, an …

Sparse optimization refers to an optimization problem involving the zero-norm in objective or
constraints. In this paper, nonconvex approximation approaches for sparse optimization …

This article considers the resource allocation algorithm design for downlink multiple-input
single-output (MISO) orthogonal frequency division multiple access (OFDMA) ultra-reliable …