摘要
In this paper, we consider solving a class of nonconvex and nonsmooth problems frequently appearing in signal processing andmachine learning research. The traditional alternating directionmethod 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-Lojasiewicz property. Several numerical results are presented to demonstrate the efficiency of the proposed algorithm.
- 出版日期2018-10-15
- 单位中国人民解放军国防科学技术大学; 湘潭大学