Block-wise ADMM with a relaxation factor for multiple-block convex programming

DOI10.1007/s40305-017-0186-yzbMath1424.90204OpenAlexW2791264501MaRDI QIDQ2422129

Ming-Hua Xu, Xiao-Ming Yuan, Bing-sheng He

Publication date: 18 June 2019

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-017-0186-y

zbMATH Keywords

convex programmingalternating direction method of multipliersoperator splitting methodsFortin and Glowinski's relaxation factor

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (10)

Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints ⋮ Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis ⋮ A relaxed proximal ADMM method for block separable convex programming ⋮ The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis ⋮ A flexible ADMM algorithm for big data applications ⋮ A partially proximal S-ADMM for separable convex optimization with linear constraints ⋮ A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization ⋮ A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming ⋮ Longitudinal image analysis via path regression on the image manifold ⋮ A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Gradient methods for minimizing composite functions
• Alternating direction augmented Lagrangian methods for semidefinite programming
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• Proximal alternating directions method for structured variational inequalities
• Multiplier and gradient methods
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

This page was built for publication: Block-wise ADMM with a relaxation factor for multiple-block convex programming