Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming

From MaRDI portal
Publication:5359115

DOI10.1287/moor.2016.0822zbMath1371.90103OpenAlexW2586868972MaRDI QIDQ5359115

Min Tao, Bing-sheng He, Xiao-Ming Yuan

Publication date: 22 September 2017

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2016.0822




Related Items

A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programmingAn algorithm twisted from generalized ADMM for multi-block separable convex minimization modelsOn the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex functionOn the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMMAlternating proximal gradient method for convex minimizationGlobal convergence of unmodified 3-block ADMM for a class of convex minimization problemsOn the information-adaptive variants of the ADMM: an iteration complexity perspectiveA generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraintsRegularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spacesConvergence of ADMM for multi-block nonconvex separable optimization modelsOn the Efficiency of Random Permutation for ADMM and Coordinate DescentHybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex ProgrammingFaster convergence of a randomized coordinate descent method for linearly constrained optimization problemsLinearized block-wise alternating direction method of multipliers for multiple-block convex programmingAsynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programsA Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraintsNonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysisConvergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling termsA class of ADMM-based algorithms for three-block separable convex programmingThe direct extension of ADMM for multi-block convex minimization problems is not necessarily convergentBlock-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and BeyondA parallel splitting ALM-based algorithm for separable convex programmingRandomized primal-dual proximal block coordinate updatesConvergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimizationAn efficient partial parallel method with scaling step size strategy for three-block convex optimization problems