Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
arXiv:1709.00483 · doi:10.1109/TSP.2018.2868269
Abstract
In this paper, we consider solving a class of nonconvex and nonsmooth problems frequently appearing in signal processing and machine learning research. The traditional alternating direction method of multipliers encounters troubles in both mathematics and computations in solving the nonconvex and nonsmooth subproblem. In view of this, we propose a reweighted alternating direction method of multipliers. In this algorithm, all subproblems are convex and easy to solve. We also provide several guarantees for the convergence and prove that the algorithm globally converges to a critical point of an auxiliary function with the help of the Kurdyka-Łojasiewicz property. Several numerical results are presented to demonstrate the efficiency of the proposed algorithm.
References in corpus (7)
- An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
- Global convergence of splitting methods for nonconvex composite optimization
- Nonconvex Nonsmooth Low-Rank Minimization via Iteratively Reweighted Nuclear Norm
- Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
- Generalized Singular Value Thresholding