Tight global linear convergence rate bounds for Douglas-Rachford splitting

DOI10.1007/s11784-017-0417-1zbMath1380.65104arXiv1506.01556OpenAlexW2962964459WikidataQ59612021 ScholiaQ59612021MaRDI QIDQ1684840

Pontus Giselsson

Publication date: 12 December 2017

Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.01556

zbMATH Keywords

linear convergencemonotone operatorsDouglas-Rachford splittingfixed-point iterationsmonotone inclusion problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)

Related Items

On the minimal displacement vector of compositions and convex combinations of nonexpansive mappings, On compositions of special cases of Lipschitz continuous operators, Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry, Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging, Quantitative inconsistent feasibility for averaged mappings, Tight global linear convergence rate bounds for Douglas-Rachford splitting, Strongly Nonexpansive Mappings Revisited: Uniform Monotonicity and Operator Splitting, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem, On a new simple algorithm to compute the resolvents, Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions, Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection, Parameter Selection and Preconditioning for a Graph Form Solver, Distributed model predictive control for continuous‐time nonlinear systems based on suboptimal ADMM, Envelope functions: unifications and further properties, Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions, Generalized monotone operators and their averaged resolvents, Strengthened splitting methods for computing resolvents, A review of nonlinear FFT-based computational homogenization methods, On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces, Unnamed Item, Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator, Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators, On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting, Necessary conditions for linear convergence of iterated expansive, set-valued mappings, Plug-and-Play Unplugged: Optimization-Free Reconstruction Using Consensus Equilibrium, Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators, On the linear convergence rate of a relaxed forward–backward splitting method, Adaptive Douglas--Rachford Splitting Algorithm from a Yosida Approximation Standpoint, Degenerate Preconditioned Proximal Point Algorithms, Conical averagedness and convergence analysis of fixed point algorithms

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
• Compositions and convex combinations of averaged nonexpansive operators
• On the linear convergence of the alternating direction method of multipliers
• Monotone (nonlinear) operators in Hilbert space
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Tight global linear convergence rate bounds for Douglas-Rachford splitting
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Linear convergence of the Douglas–Rachford method for two closed sets
• Proximal Splitting Methods in Signal Processing
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
• Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
• Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• Convergence Rate Analysis of Several Splitting Schemes
• Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
• Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Mean Value Methods in Iteration
• Convex analysis and monotone operator theory in Hilbert spaces