Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases

DOI10.1007/s10957-017-1211-3OpenAlexW2776251461MaRDI QIDQ1743535

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

zbMATH Keywords

primal-dual algorithmalternating direction method of multipliersstrong convexitylinear convergence rate

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Optimality conditions for minimax problems (49K35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On the ergodic convergence rates of a first-order primal-dual algorithm
• On the linear convergence of the alternating direction method of multipliers
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Introductory lectures on convex optimization. A basic course.
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Adaptive restart for accelerated gradient schemes
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Linear convergence of first order methods for non-strongly convex optimization
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• Variational Analysis
• On the Convergence of Primal-Dual Hybrid Gradient Algorithm
• Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
• Proximité et dualité dans un espace hilbertien
• An introduction to continuous optimization for imaging
• Local linear convergence analysis of Primal–Dual splitting methods