A Unified Successive Pseudo-Convex Approximation Framework

Abstract

In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of successively refined approximate problems, each of which is much easier to solve than the original problem. To achieve convergence, the approximate problem only needs to exhibit a weak form of convexity, namely, pseudo-convexity. We show that the proposed framework not only includes as special cases a number of existing methods, for example, the gradient method and the Jacobi algorithm, but also leads to new algorithms which enjoy easier implementation and faster convergence speed. We also propose a novel line search method for nondifferentiable optimization problems, which is carried out over a properly constructed differentiable function with the benefit of a simplified implementation as compared to state-of-the-art line search techniques that directly operate on the original nondifferentiable objective function. The advantages of the proposed algorithm are shown, both theoretically and numerically, by several example applications, namely, MIMO broadcast channel capacity computation, energy efficiency maximization in massive MIMO systems and LASSO in sparse signal recovery.

submitted to IEEE Transactions on Signal Processing; original title: A Novel Iterative Convex Approximation Method

References in corpus (3)

• Pathwise coordinate optimization
• Parallel and Distributed Methods for Nonconvex Optimization--Part II: Applications
• Energy-Efficient Power Control: A Look at 5G Wireless Technologies

Cited by in corpus (18)

• Large-Scale-Fading Decoding in Cellular Massive MIMO Systems with Spatially Correlated Channels
• Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
• A Globally Optimal Energy-Efficient Power Control Framework and its Efficient Implementation in Wireless Interference Networks
• Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations
• Mixed Monotonic Programming for Fast Global Optimization
• Graph-based Algorithm Unfolding for Energy-aware Power Allocation in Wireless Networks
• Improper Signaling for SISO Two-user Interference Channels with Additive Asymmetric Hardware Distortion
• Energy efficiency optimization in MIMO interference channels: A successive pseudoconvex approximation approach
• Energy-Efficient UAV Relaying Robust Resource Allocation in Uncertain Adversarial Networks
• Interference Exploitation-based Hybrid Precoding with Robustness Against Phase Errors
• Solving Fractional Polynomial Problems by Polynomial Optimization Theory
• Edge and Central Cloud Computing: A Perfect Pairing for High Energy Efficiency and Low-latency
• Optimization of Weighted Individual Energy Efficiencies in Interference Network
• Extended Successive Convex Approximation for Phase Retrieval with Dictionary Learning
• Learning to Transmit with Provable Guarantees in Wireless Federated Learning
• A Provably Communication-Efficient Asynchronous Distributed Inference Method for Convex and Nonconvex Problems
• Discretization of Maxwell's Equations for Non-inertial Observers Using Space-Time Algebra
• Transforming physics-informed machine learning to convex optimization