Optimization Online


Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems

Sun Tao (nudtsuntao***at***163.com)
Jiang Hao (haojiang***at***nudt.edu.cn)
Cheng Lizhi ( clzcheng***at***nudt.edu.cn)

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 calculate. 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.

Keywords: Alternating direction method of multipliers; iteratively reweighted algorithm; nonconvex and nonsmooth minimization; Kurdyka-Lojasiewicz property

Category 1: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 09/18/2017
Entry Accepted: 09/18/2017
Entry Last Modified: 09/18/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society