Inexact alternating direction methods of multipliers for separable convex optimization

DOI10.1007/s10589-019-00072-2zbMath1414.90228arXiv1604.02494OpenAlexW2913507074WikidataQ128491167 ScholiaQ128491167MaRDI QIDQ2419545

William W. Hager, Hongchao Zhang

Publication date: 13 June 2019

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

Full work available at URL: https://arxiv.org/abs/1604.02494

zbMATH Keywords

global convergencealternating direction method of multipliersseparable convex optimizationmultiple blocksinexact ADMM

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Complexity and performance of numerical algorithms (65Y20)

Related Items

A variable projection method for large-scale inverse problems with \(\ell^1\) regularization, Efficient alternating minimization methods for variational edge-weighted colorization models, Convergence rates for an inexact ADMM applied to separable convex optimization, Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers, A variational approach to Gibbs artifacts removal in MRI, On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming, A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance, An inexact accelerated stochastic ADMM for separable convex optimization

Uses Software

• PPROJ

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
• A practical relative error criterion for augmented Lagrangians
• An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
• On the linear convergence of the alternating direction method of multipliers
• Alternating direction augmented Lagrangian methods for semidefinite programming
• A three-operator splitting scheme and its optimization applications
• 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
• A proximal-based deomposition method for compositions method for convex minimization problems
• A new inexact alternating directions method for monotone variational inequalities
• Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
• Approximate ADMM algorithms derived from Lagrangian splitting
• A note on the alternating direction method of multipliers
• Bregman operator splitting with variable stepsize for total variation image reconstruction
• 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
• Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm
• Projection onto a Polyhedron that Exploits Sparsity
• An alternating direction-based contraction method for linearly constrained separable convex programming problems
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Fast Multiple-Splitting Algorithms for Convex Optimization
• 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
• Two-Point Step Size Gradient Methods
• Modified Lagrangians in convex programming and their generalizations
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• On the Global Linear Convergence of the ADMM with MultiBlock Variables
• Convex Analysis
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent