Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations

Abstract

In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex functions. The proposed framework is based on a nontrivial combination of the majorization-minimization framework and the successive convex approximation framework proposed in literature for a convex regularization function. The proposed framework has several attractive features, namely, i) flexibility, as different choices of the approximate function lead to different type of algorithms; ii) fast convergence, as the problem structure can be better exploited by a proper choice of the approximate function and the stepsize is calculated by the line search; iii) low complexity, as the approximate function is convex and the line search scheme is carried out over a differentiable function; iv) guaranteed convergence to a stationary point. We demonstrate these features by two example applications in subspace learning, namely, the network anomaly detection problem and the sparse subspace clustering problem. Customizing the proposed framework by adopting the best-response type approximation, we obtain soft-thresholding with exact line search algorithms for which all elements of the unknown parameter are updated in parallel according to closed-form expressions. The attractive features of the proposed algorithms are illustrated numerically.

submitted to IEEE Journal of Selected Topics in Signal Processing, special issue in Robust Subspace Learning

References in corpus (9)

• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems
• Parallel Selective Algorithms for Big Data Optimization
• Dynamic Anomalography: Tracking Network Anomalies via Sparsity and Low Rank
• A Unified Successive Pseudo-Convex Approximation Framework
• In-network Sparsity-regularized Rank Minimization: Algorithms and Applications
• Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization
• Sparse Nonlinear Regression: Parameter Estimation and Asymptotic Inference
• Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis

Cited by in corpus (5)

• Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
• UAV-Aided Jamming for Secure Ground Communication with Unknown Eavesdropper Location
• Extended Successive Convex Approximation for Phase Retrieval with Dictionary Learning
• Gridded UAV Swarm for Secrecy Rate Maximization with Unknown Eavesdropper
• Joint Optimization of Trajectory, Propulsion and Thrust Powers for Covert UAV-on-UAV Video Tracking and Surveillance