On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function

DOI10.1007/s10589-016-9860-yzbMath1372.90079OpenAlexW2502737401MaRDI QIDQ2397092

Deren Han, Xing-Ju Cai, Xiao-Ming Yuan

Publication date: 29 May 2017

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-016-9860-y

zbMATH Keywords

convergence analysisconvex programmingalternating direction method of multipliersseparable structure

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

A parallel Gauss-Seidel method for convex problems with separable structure ⋮ Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Global convergence of unmodified 3-block ADMM for a class of convex minimization problems ⋮ A partially isochronous splitting algorithm for three-block separable convex minimization problems ⋮ A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints ⋮ A unified primal-dual algorithm framework for inequality constrained problems ⋮ Inexact alternating direction methods of multipliers for separable convex optimization ⋮ Convergence of ADMM for multi-block nonconvex separable optimization models ⋮ A linear algebra perspective on the random multi-block ADMM: the QP case ⋮ Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems ⋮ Consensus-based Dantzig-Wolfe decomposition ⋮ Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization ⋮ A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming ⋮ Linearized block-wise alternating direction method of multipliers for multiple-block convex programming ⋮ Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights ⋮ On the convergence rate of the augmented Lagrangian-based parallel splitting method ⋮ A Block Lanczos Method for the Extended Trust-Region Subproblem ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs ⋮ The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex ⋮ Local linear convergence of an ADMM-type splitting framework for equality constrained optimization ⋮ A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming ⋮ Fast algorithms for sparse portfolio selection considering industries and investment styles ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ ON THE CONVERGENCE RATE OF THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS IN A COMPLEX DOMAIN ⋮ Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems ⋮ Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization ⋮ Lattice-Based Patterned Fabric Inspection by Using Total Variation with Sparsity and Low-Rank Representations ⋮ Variable splitting based method for image restoration with impulse plus Gaussian noise ⋮ An extended proximal ADMM algorithm for three-block nonconvex optimization problems ⋮ A proximal alternating direction method for multi-block coupled convex optimization ⋮ Randomized primal-dual proximal block coordinate updates ⋮ A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization ⋮ Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints ⋮ A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization ⋮ Alternating direction based method for optimal control problem constrained by Stokes equation ⋮ A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems ⋮ Proximal ADMM for nonconvex and nonsmooth optimization ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems ⋮ An inexact accelerated stochastic ADMM for separable convex optimization ⋮ Two-step fixed-point proximity algorithms for multi-block separable convex problems

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On the sublinear convergence rate of multi-block ADMM
• Parallel multi-block ADMM with \(o(1/k)\) convergence
• A first-order primal-dual algorithm for convex problems with applications to imaging
• 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
• Multiplier and gradient methods
• Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Node-Based Learning of Multiple Gaussian Graphical Models
• 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
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• Some continuity properties of polyhedral multifunctions
• Monotone Operators and the Proximal Point Algorithm
• Metric Subregularity of Piecewise Linear Multifunctions and Applications to Piecewise Linear Multiobjective Optimization
• A splitting method for separable convex programming
• A Generalized Proximal Point Algorithm and Its Convergence Rate
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
• On the Global Linear Convergence of the ADMM with MultiBlock Variables
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent