On the O(1/n) convergence rate of the Douglas-Rachford alternating direction method
From MaRDI portal
Publication:2903008
DOI10.1137/110836936zbMATH Open1245.90084OpenAlexW1986080131MaRDI QIDQ2903008FDOQ2903008
Authors: Bingsheng He, Xiaoming Yuan 
Publication date: 23 August 2012
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110836936
Recommendations
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
- On the convergence rate of Douglas-Rachford operator splitting method
- ON THE CONVERGENCE RATE OF THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS IN A COMPLEX DOMAIN
Cited In (only showing first 100 items - show all)
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization
- The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex
- Sparsest piecewise-linear regression of one-dimensional data
- An alternate minimization method beyond positive definite proximal regularization: convergence and complexity
- Peridynamics enabled learning partial differential equations
- Convergence of the augmented decomposition algorithm
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
- ON THE CONVERGENCE RATE OF THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS IN A COMPLEX DOMAIN
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity
- An ADMM-based SQP method for separably smooth nonconvex optimization
- A regularized alternating direction method of multipliers for a class of nonconvex problems
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
- Partial error bound conditions and the linear convergence rate of the alternating direction method of multipliers
- Discerning the linear convergence of ADMM for structured convex optimization through the lens of variational analysis
- Application of the alternating direction method of multipliers to control constrained parabolic optimal control problems and beyond
- A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming
- Dynamic stochastic approximation for multi-stage stochastic optimization
- General splitting methods with linearization for the split feasibility problem
- Convergence rates for an inexact ADMM applied to separable convex optimization
- A survey on conic relaxations of optimal power flow problem
- The distance between convex sets with Minkowski sum structure: application to collision detection
- New regularization models for image denoising with a spatially dependent regularization parameter
- LINEARIZED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR SEPARABLE CONVEX OPTIMIZATION OF REAL FUNCTIONS IN COMPLEX DOMAIN
- Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers
- Selective linearization for multi-block statistical learning
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- On convergence rates of proximal alternating direction method of multipliers
- Robust regularized extreme learning machine for regression with non-convex loss function via DC program
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- An LQP-based symmetric alternating direction method of multipliers with larger step sizes
- ADMM for Penalized Quantile Regression in Big Data
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
- Learning partial differential equations via data discovery and sparse optimization
- A convex optimization model and algorithm for retinex
- Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization
- An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming
- Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
- A Flexible Space-Variant Anisotropic Regularization for Image Restoration with Automated Parameter Selection
- Iterative positive thresholding algorithm for non-negative sparse optimization
- On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM
- Stable camera motion estimation using convex programming
- Phase retrieval from incomplete magnitude information via total variation regularization
- A distributed quantile estimation algorithm of heavy-tailed distribution with massive datasets
- Simultaneous image fusion and denoising by using fractional-order gradient information
- A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming
- Sensitivity analysis of the proximal-based parallel decomposition methods
- Preconditioned ADMM for a class of bilinear programming problems
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Block-wise ADMM with a relaxation factor for multiple-block convex programming
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Iteration-complexity analysis of a generalized alternating direction method of multipliers
- A dual split Bregman method for fast \(\ell ^{1}\) minimization
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- On the global and linear convergence of the generalized alternating direction method of multipliers
- An implementable first-order primal-dual algorithm for structured convex optimization
- A parallel splitting ALM-based algorithm for separable convex programming
- Bounding duality gap for separable problems with linear constraints
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- Stochastic primal dual fixed point method for composite optimization
- Solving total-variation image super-resolution problems via proximal symmetric alternating direction methods
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
- On alternating direction methods of multipliers: a historical perspective
- On the linear convergence of the alternating direction method of multipliers
- On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
- A class of ADMM-based algorithms for three-block separable convex programming
- Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- On the convergence rate of Douglas-Rachford operator splitting method
- Alternating proximal gradient method for convex minimization
- Modified alternating direction methods for the modified multiple-sets split feasibility problems
- Approximation schemes for materials with discontinuities
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- A phase model for point spread function estimation in ground-based astronomy
- Two-step methods for image zooming using duality strategies
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming
- On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Conic optimization via operator splitting and homogeneous self-dual embedding
- A proximal point algorithm revisit on the alternating direction method of multipliers
This page was built for publication: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903008)
