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 …
[HTML][HTML] 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 …
[HTML][HTML] Variations and extension of the convex–concave procedure
T Lipp, S Boyd - Optimization and Engineering, 2016 - Springer
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 …
convex optimization to find local optima of difference of convex (DC) programming problems …
Multiplexing URLLC traffic within eMBB services in 5G NR: Fair scheduling
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 …
(eMBB) and ultra-reliable low-latency communication (URLLC). Due to the severe constraint …
Communications, caching, and computing for mobile virtual reality: Modeling and tradeoff
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 …
immersive VR experience requires the wireless delivery of huge data at ultra-low latency …
The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
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 …
function f= g− h (with g, h being lower semicontinuous proper convex functions on R n) on …
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 …
[HTML][HTML] DC formulations and algorithms for sparse optimization problems
J Gotoh, A Takeda, K Tono - Mathematical Programming, 2018 - Springer
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 …
optimization problems having a cardinality or rank constraint. With the largest-k norm, an …
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 …
Resource allocation for multi-user downlink MISO OFDMA-URLLC systems
This article considers the resource allocation algorithm design for downlink multiple-input
single-output (MISO) orthogonal frequency division multiple access (OFDMA) ultra-reliable …
single-output (MISO) orthogonal frequency division multiple access (OFDMA) ultra-reliable …