On the $O(1/n)$ Convergence Rate of the Douglas-Rachford Alternating Direction Method

Authors:
Bingsheng He;Xiaoming Yuan
Affiliations:
hebma@nju.edu.cn;xmyuan@hkbu.edu.hk
Venue:
SIAM Journal on Numerical Analysis
Year:
2012

Citing 12
Cited 5

Applications of splitting algorithm to decomposition in convex programming and variational inequalities

SIAM Journal on Control and Optimization
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

Mathematical Programming: Series A and B
A variable-penalty alternating directions method for convex optimization

Mathematical Programming: Series A and B
Finite element approximation and iterative solution of a class of mildly non-linear elliptic equations

Finite element approximation and iterative solution of a class of mildly non-linear elliptic equations
Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

SIAM Journal on Optimization
A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration

Journal of Scientific Computing
Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods

SIAM Journal on Scientific Computing
Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction

SIAM Journal on Imaging Sciences
Solving Large-Scale Least Squares Semidefinite Programming by Alternating Direction Methods

SIAM Journal on Matrix Analysis and Applications
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations

SIAM Journal on Optimization
Alternating Direction Method for Image Inpainting in Wavelet Domains

SIAM Journal on Imaging Sciences
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

Foundations and Trends® in Machine Learning

Group sparse inverse covariance selection with a dual augmented lagrangian method

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems

Computational Optimization and Applications
An efficient ADMM algorithm for multidimensional anisotropic total variation regularization problems

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
An improved first-order primal-dual algorithm with a new correction step

Journal of Global Optimization
Elastic Net subspace clustering applied to pop/rock music structure analysis

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Alternating direction methods (ADMs) have been well studied in the literature, and they have found many efficient applications in various fields. In this note, we focus on the Douglas-Rachford ADM scheme proposed by Glowinski and Marrocco, and we aim at providing a simple approach to estimating its convergence rate in terms of the iteration number. The linearized version of this ADM scheme, which is known as the split inexact Uzawa method in the image processing literature, is also discussed.