A New Decomposition Method for Multiuser DC-Programming and Its Applications

DOI10.1109/TSP.2014.2315167MaRDI QIDQ4579244zbMATH OpenOpenAlexFDO

Authors Alberth Alvarado, Gesualdo Scutari, Jong-Shi Pang

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2014.2315167

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Cited in

(23)

• DC programming and DCA for enhancing physical layer security via cooperative jamming
• On the pervasiveness of difference-convexity in optimization and statistics
• A proximal difference-of-convex algorithm with extrapolation
• DC programming and DCA: thirty years of developments
• DC decomposition of nonconvex polynomials with algebraic techniques
• Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
• A unified Douglas-Rachford algorithm for generalized DC programming
• The modified second APG method for DC optimization problems
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
• Mechanism design for demand management in energy communities
• DC programming and DCA for a novel resource allocation problem in emerging area of cooperative physical layer security
• Computing B-stationary points of nonsmooth DC programs
• Variational multiplicative noise removal by DC programming
• Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
• Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
• Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
• Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
• On the rate of convergence of the difference-of-convex algorithm (DCA)
• Constructing tight quadratic relaxations for global optimization. II: underestimating difference-of-convex (D.C.) functions
• Equivalence of the Polyak-Łojasiewicz-Kurdyka exponent via difference-of-Moreau-envelope smoothing
• General inertial proximal DC algorithm for three block nonsmooth DC optimization problems
• Contractive difference-of-convex algorithms
• An extragradient method for generalized DC programming

This page was built for publication: A New Decomposition Method for Multiuser DC-Programming and Its Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579244)