A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization
arXiv:1711.04489
Abstract
In this paper, we propose a convergent parallel best-response algorithm with the exact line search for the nondifferentiable nonconvex sparsity-regularized rank minimization problem. On the one hand, it exhibits a faster convergence than subgradient algorithms and block coordinate descent algorithms. On the other hand, its convergence to a stationary point is guaranteed, while ADMM algorithms only converge for convex problems. Furthermore, the exact line search procedure in the proposed algorithm is performed efficiently in closed-form to avoid the meticulous choice of stepsizes, which is however a common bottleneck in subgradient algorithms and successive convex approximation algorithms. Finally, the proposed algorithm is numerically tested.
arXiv commentSubmitted to IEEE ICASSP 2017
References in corpus (7)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Parallel Selective Algorithms for Big Data Optimization
- Dynamic Anomalography: Tracking Network Anomalies via Sparsity and Low Rank
- Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies
- Block- and Rank-Sparse Recovery for Direction Finding in Partly Calibrated Arrays
- Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis