Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases
DOI10.1007/S10957-017-1211-3OpenAlexW2776251461MaRDI QIDQ1743535FDOQ1743535
Authors: Pauline Tan 
Publication date: 13 April 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1211-3
Recommendations
- On the linear convergence of the alternating direction method of multipliers
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Convergence analysis on a modified generalized alternating direction method of multipliers
- Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs
alternating direction method of multipliersprimal-dual algorithmstrong convexitylinear convergence rate
Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Optimality conditions for minimax problems (49K35)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Variational Analysis
- Introductory lectures on convex optimization. A basic course.
- Adaptive restart for accelerated gradient schemes
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Title not available (Why is that?)
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- Proximité et dualité dans un espace hilbertien
- On the convergence of primal-dual hybrid gradient algorithm
- Title not available (Why is that?)
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the linear convergence of the alternating direction method of multipliers
- An introduction to continuous optimization for imaging
- Linear convergence of first order methods for non-strongly convex optimization
- Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions
- Local linear convergence analysis of primal-dual splitting methods
Cited In (4)
- ON THE CONVERGENCE RATE OF THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS IN A COMPLEX DOMAIN
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
This page was built for publication: Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743535)
