Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators
From MaRDI portal
Publication:5242929
DOI10.1137/18M121160XzbMath1440.47054arXiv1809.00761MaRDI QIDQ5242929
Publication date: 8 November 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.00761
global convergencestrong monotonicitylinear convergenceLipschitz continuityDouglas-Rachford algorithmweak monotonicityFejér monotonicityinclusion problem
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Rate of convergence, degree of approximation (41A25) Decomposition methods (49M27) Fixed-point iterations (47J26)
Related Items (20)
An adaptive splitting algorithm for the sum of two generalized monotone operators and one cocoercive operator ⋮ On compositions of special cases of Lipschitz continuous operators ⋮ Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator ⋮ Convergence analysis of two-step inertial Douglas-Rachford algorithm and application ⋮ A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes ⋮ Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem ⋮ Computing the resolvent of the sum of operators with application to best approximation problems ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ On a new simple algorithm to compute the resolvents ⋮ Demiclosedness principles for generalized nonexpansive mappings ⋮ Strict pseudocontractions and demicontractions, their properties, and applications ⋮ Generalized monotone operators and their averaged resolvents ⋮ Strengthened splitting methods for computing resolvents ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators ⋮ Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ An adaptive alternating direction method of multipliers ⋮ Adaptive Douglas--Rachford Splitting Algorithm from a Yosida Approximation Standpoint ⋮ Conical averagedness and convergence analysis of fixed point algorithms
Cites Work
- Unnamed Item
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Partial inverse of a monotone operator
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Fifty years of maximal monotonicity
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
- The Douglas-Rachford algorithm for the case of the sphere and the line
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
- The Douglas-Rachford algorithm in the affine-convex case
- Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator
- On the Douglas-Rachford algorithm
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Set-valued mappings and enlargement of monotone operators.
- Linear convergence of the Douglas–Rachford method for two closed sets
- Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- On Weak Convergence of the Douglas–Rachford Method
- Strong and Weak Convexity of Sets and Functions
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- Norm convergence of realistic projection and reflection methods
- Linear Convergence of Projection Algorithms
- Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators
