Convergence of Bregman alternating direction method with multipliers for nonconvex composite problems

Abstract

The alternating direction method with multipliers (ADMM) has been one of most powerful and successful methods for solving various convex or nonconvex composite problems that arise in the fields of image & signal processing and machine learning. In convex settings, numerous convergence results have been established for ADMM as well as its varieties. However, due to the absence of convexity, the convergence analysis of nonconvex ADMM is generally very difficult. In this paper we study the Bregman modification of ADMM (BADMM), which includes the conventional ADMM as a special case and often leads to an improvement of the performance of the algorithm. Under certain assumptions, we prove that the iterative sequence generated by BADMM converges to a stationary point of the associated augmented Lagrangian function. The obtained results underline the feasibility of ADMM in applications under nonconvex settings.

arXiv comment17 pages, 2 figures

References in corpus (6)

• An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
• $L_{1/2}$ Regularization: Convergence of Iterative Half Thresholding Algorithm
• Parallel Algorithms for Constrained Tensor Factorization via the Alternating Direction Method of Multipliers
• A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• Dictionary LASSO: Guaranteed Sparse Recovery under Linear Transformation

Cited by in corpus (20)

• Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
• Inexact-ADMM Based Federated Meta-Learning for Fast and Continual Edge Learning
• Convergence of multi-block Bregman ADMM for nonconvex composite problems
• An Empirical Study of ADMM for Nonconvex Problems
• A Stochastic Alternating Direction Method of Multipliers for Non-smooth and Non-convex Optimization
• A General System for Heuristic Solution of Convex Problems over Nonconvex Sets
• Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization
• Alternating Direction Method of Multipliers for A Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
• A two-level distributed algorithm for nonconvex constrained optimization
• Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs
• A Scale Invariant Approach for Sparse Signal Recovery
• A Two-level ADMM Algorithm for AC OPF with Global Convergence Guarantees
• Convergence for nonconvex ADMM, with applications to CT imaging
• Dual Descent ALM and ADMM
• The Application of Multi-block ADMM on Isotonic Regression Problems
• MOCCA: mirrored convex/concave optimization for nonconvex composite functions
• Every critical point of an L0 composite minimization problem is a local minimizer
• A Provably Convergent Information Bottleneck Solution via ADMM
• A Survey on Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning
• Efficient and Robust Recovery of Sparse Signal and Image Using Generalized Nonconvex Regularization