Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
From MaRDI portal
Publication:4579127
Cited in
(12)- A proximal difference-of-convex algorithm with extrapolation
- The modified second APG method for DC optimization problems
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Computing B-stationary points of nonsmooth DC programs
- Joint Network Optimization and Downlink Beamforming for CoMP Transmissions Using Mixed Integer Conic Programming
- Optimal Joint User Association and Multi-Pattern Resource Allocation in Heterogeneous Networks
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Dynamic Partitioning and Coverage Control With Asynchronous One-to-Base-Station Communication
- 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
- Equivalence of the Polyak-Łojasiewicz-Kurdyka exponent via difference-of-Moreau-envelope smoothing
- A multi-step inertial Bregman proximal DC algorithm and its application to solving some inverse problems
This page was built for publication: Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579127)