Convergence rates for an inexact ADMM applied to separable convex optimization
From MaRDI portal
Publication:2023686
DOI10.1007/s10589-020-00221-yzbMath1466.90072arXiv2001.02503OpenAlexW2998919771MaRDI QIDQ2023686
Hongchao Zhang, William W. Hager
Publication date: 3 May 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.02503
ADMMconvergence ratesglobal convergencealternating direction method of multipliersinexact methodsseparable convex optimizationaccelerated gradient method
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, A linear algebra perspective on the random multi-block ADMM: the QP case, Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach, A parallel splitting ALM-based algorithm for separable convex programming, An inexact ADMM with proximal-indefinite term and larger stepsize, An inexact accelerated stochastic ADMM for separable convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- 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
- Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor
- Optimally linearizing the alternating direction method of multipliers for convex programming
- 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 for separable convex optimization
- 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
- Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
- An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm
- 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
- Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers
- Some continuity properties of polyhedral multifunctions
- Monotone Operators and the Proximal Point Algorithm
- Modified Lagrangians in convex programming and their generalizations
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
