A New Decomposition Method for Multiuser DC-Programming and Its Applications
From MaRDI portal
Publication:4579244
Cited in
(18)- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- On the pervasiveness of difference-convexity in optimization and statistics
- A unified Douglas-Rachford algorithm for generalized DC programming
- 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 methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
- DC programming and DCA for enhancing physical layer security via cooperative jamming
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- DC programming and DCA for a novel resource allocation problem in emerging area of cooperative physical layer security
- Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
- Computing B-stationary points of nonsmooth DC programs
- Variational multiplicative noise removal by DC programming
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Mechanism design for demand management in energy communities
- The modified second APG method for DC optimization problems
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)
