Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
From MaRDI portal
(Redirected from Publication:1668709)
Abstract: The alternating direction method of multipliers (ADMM) has been successfully applied to solve structured convex optimization problems due to its superior practical performance. The convergence properties of the 2-block ADMM have been studied extensively in the literature. Specifically, it has been proven that the 2-block ADMM globally converges for any penalty parameter . In this sense, the 2-block ADMM allows the parameter to be free, i.e., there is no need to restrict the value for the parameter when implementing this algorithm in order to ensure convergence. However, for the 3-block ADMM, Chen etal cite{Chen-admm-failure-2013} recently constructed a counter-example showing that it can diverge if no further condition is imposed. The existing results on studying further sufficient conditions on guaranteeing the convergence of the 3-block ADMM usually require to be smaller than a certain bound, which is usually either difficult to compute or too small to make it a practical algorithm. In this paper, we show that the 3-block ADMM still globally converges with any penalty parameter if the third function in the objective is smooth and strongly convex, and its condition number is in , besides some other mild conditions. This requirement covers an important class of problems to be called regularized least squares decomposition (RLSD) in this paper.
Recommendations
- On the sublinear convergence rate of multi-block ADMM
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
Cites work
- A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A note on the alternating direction method of multipliers
- A splitting method for separable convex programming
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating direction method with Gaussian back substitution for separable convex programming
- Compressive principal component pursuit
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Global convergence of splitting methods for nonconvex composite optimization
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs
- Median filtering-based methods for static background extraction from surveillance video.
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- On the linear convergence of the alternating direction method of multipliers
- On the sublinear convergence rate of multi-block ADMM
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
Cited in
(25)- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- Robust Bayesian model selection for variable clustering with the Gaussian graphical model
- A two-level distributed algorithm for nonconvex constrained optimization
- A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block
- On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
- Some notes on the divergence example for multi-block alternating direction method of multipliers
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- scientific article; zbMATH DE number 7448328 (Why is no real title available?)
- Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints
- On the convergence rate of inexact majorized sGS ADMM with indefinite proximal terms for convex composite programming
- Diagonally Dominant Principal Component Analysis
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- ADMM for multiaffine constrained optimization
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM
- Efficient learning rate adaptation based on hierarchical optimization approach
- Dual descent augmented Lagrangian method and alternating direction method of multipliers
- Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions
- Research on the convergence rate of Bregman ADMM for nonconvex multiblock optimization
- A class of ADMM-based algorithms for three-block separable convex programming
- Using filter methods to guide convergence for ADMM, with applications to nonnegative matrix factorization problems
- Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise
- On the sublinear convergence rate of multi-block ADMM
This page was built for publication: Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1668709)
