Parallel and Distributed Methods for Nonconvex Optimization--Part II: Applications
arXiv:1601.04059 · doi:10.1109/TSP.2016.2637317
Abstract
In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted to the application of the framework to some resource allocation problems in communication networks. In particular, we consider two non-trivial case-study applications, namely: (generalizations of) i) the rate profile maximization in MIMO interference broadcast networks; and the ii) the max-min fair multicast multigroup beamforming problem in a multi-cell environment. We develop a new class of algorithms enjoying the following distinctive features: i) they are \emph{distributed} across the base stations (with limited signaling) and lead to subproblems whose solutions are computable in closed form; and ii) differently from current relaxation-based schemes (e.g., semidefinite relaxation), they are proved to always converge to d-stationary solutions of the aforementioned class of nonconvex problems. Numerical results show that the proposed (distributed) schemes achieve larger worst-case rates (resp. signal-to-noise interference ratios) than state-of-the-art centralized ones while having comparable computational complexity.
Part I of this paper can be found at http://arxiv.org/abs/1410.4754
References in corpus (2)
Cited by in corpus (48)
- Federated Learning over Wireless Networks: Convergence Analysis and Resource Allocation
- Signal Processing for High Throughput Satellite Systems: Challenges in New Interference-Limited Scenarios
- Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
- CellOS: Zero-touch Softwarized Open Cellular Networks
- Local Stackelberg equilibrium seeking in generalized aggregative games
- Multi-Edge Server-Assisted Dynamic Federated Learning with an Optimized Floating Aggregation Point
- Energy efficiency optimization in MIMO interference channels: A successive pseudoconvex approximation approach
- Fresh, Fair and Energy-Efficient Content Provision in a Private and Cache-Enabled UAV Network
- Coded Computation across Shared Heterogeneous Workers with Communication Delay
- Linearized ADMM for Non-convex Non-smooth Optimization with Convergence Analysis
- A Decentralized Proximal Point-type Method for Saddle Point Problems
- Asynchronous Parallel Algorithms for Nonconvex Big-Data Optimization. Part II: Complexity and Numerical Results
- To Talk or to Work: Flexible Communication Compression for Energy Efficient Federated Learning over Heterogeneous Mobile Edge Devices
- Multiple Access Computational Offloading: Communication Resource Allocation in the Two-User Case (Extended Version)
- Personalized incentives as feedback design in generalized Nash equilibrium problems
- Robust and Communication-Efficient Collaborative Learning
- Distributed Deep Learning with Event-Triggered Communication
- Asynchronous Decentralized Successive Convex Approximation
- Clustering with Distributed Data
- Mobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit Allocation and Path Planning
- Intelligent Reflecting Surface Assisted Secure Wireless Communications with Multiple-Transmit and Multiple-Receive Antennas
- Conic Quadratic Formulations for Wireless Communications Design
- Fast and Stable Nonconvex Constrained Distributed Optimization: The ELLADA Algorithm
- Solving High-Order Portfolios via Successive Convex Approximation Algorithms
- Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I
- Efficient Resource Allocation for Relay-Assisted Computation Offloading in Mobile Edge Computing
- Escaping Saddle Points with the Successive Convex Approximation Algorithm
- Percentile Optimization in Wireless Networks- Part I: Power Control for Max-Min-Rate to Sum-Rate Maximization (and Everything in Between)
- Repeatedly Energy-Efficient and Fair Service Coverage: UAV Slicing (Proactive UAV Network Slicing for URLLC and Mobile Broadband Service Multiplexing)
- A Provably Communication-Efficient Asynchronous Distributed Inference Method for Convex and Nonconvex Problems
- Joint Uplink/Downlink Optimization for Backhaul-Limited Mobile Cloud Computing with User Scheduling
- Representation of Federated Learning via Worst-Case Robust Optimization Theory
- Percentile Optimization in Wireless Networks- Part II: Beamforming for Cell-Edge Throughput Maximization
- Multi-Antenna Coded Content Delivery with Caching: A Low-Complexity Solution
- Heterogeneous Coded Computation across Heterogeneous Workers
- Joint Transmit Precoding and Reflect Beamforming Design for IRS-Assisted MIMO Cognitive Radio Systems
- Preferential Mixture-of-Experts: Interpretable Models that Rely on Human Expertise as much as Possible
- Equilibrium Computation of Generalized Nash Games: A New Lagrangian-Based Approach
- Optimization of Massive Full-Dimensional MIMO for Positioning and Communication
- Optimizing Pilots and Analog Processing for Channel Estimation in Cell-Free Massive MIMO With One-Bit ADCs
- A Low-Complexity Cache-Aided Multi-antenna Content Delivery Scheme
- Energy-Efficient Resource Allocation for Mobile Edge Computing-Based Augmented Reality Applications
- Learning Multi-Frequency Partial Correlation Graphs
- Temperature-Resilient LC-RIS Phase-Shift Design for Multi-user Downlink Communications
- Joint Minimum DL-UL Rate Maximization for Cell-Free Massive MIMO
- Tomlinson-Harashima Precoding-Aided Multi-Antenna Non-Orthogonal Multiple Access
- User Association and Path Planning for UAV-Aided Mobile Edge Computing with Energy Restriction
- Practical Precoding via Asynchronous Stochastic Successive Convex Approximation