On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
From MaRDI portal
Publication:314977
DOI10.1186/s13660-016-1173-2zbMath1456.90126OpenAlexW2520610208WikidataQ59466154 ScholiaQ59466154MaRDI QIDQ314977
Hui-Jie Sun, Jin jiang Wang, Ting-Quan Deng
Publication date: 19 September 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1173-2
strong monotonicityseparable convex optimizationalternating direction method of multiplierKarush-Kuhn-Tucher (KKT) systemlinear convergence rate
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Latent variable graphical model selection via convex optimization
- On the linear convergence of the alternating direction method of multipliers
- A class of linearized proximal alternating direction methods
- Lectures on numerical methods for non-linear variational problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- A new inexact alternating directions method for monotone variational inequalities
- An \(L _{2}\)-theory for a class of SPDEs driven by Lévy processes
- A note on the alternating direction method of multipliers
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Robust principal component analysis?
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Convex Analysis
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
