On the convergence rate of Douglas-Rachford operator splitting method
From MaRDI portal
Recommendations
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- A simplified proof of weak convergence in Douglas-Rachford method
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Convergence rate analysis of the forward-Douglas-Rachford splitting scheme
Cites work
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Convex analysis and monotone operator theory in Hilbert spaces
- Interior projection-like methods for monotone variational inequalities
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Proximité et dualité dans un espace hilbertien
- Self-adaptive operator splitting methods for monotone variational inequalities
- Set-valued analysis
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
Cited in
(46)- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
- Convergence rate analysis of inertial Krasnoselskii-Mann type iteration with applications
- Local saddles of relaxed averaged alternating reflections algorithms on phase retrieval
- On the optimal relaxation parameters of Krasnosel'ski–Mann iteration
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- A dual split Bregman method for fast \(\ell ^{1}\) minimization
- Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
- A unified and tight linear convergence analysis of the relaxed proximal point algorithm
- An endeavor from the Glowinski-Le Tallec splitting for approximating the solution of Kawarada equation
- On the range of the Douglas-Rachford operator
- On non-ergodic convergence rate of the operator splitting method for a class of variational inequalities
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- [[:Publication:6091103|Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}Template:K \right)}\)]]
- The Glowinski-Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- A dynamical splitting method for minimizing the sum of three convex functions
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
- Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions
- New strong convergence method for the sum of two maximal monotone operators
- Equivalent resolvents of Douglas-Rachford splitting and other operator splitting algorithms: a unified degenerate proximal point analysis
- A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems
- Convergence rates with inexact non-expansive operators
- On the convergence rate of the Krasnosel'skiĭ-Mann iteration
- New inertial method for nonexpansive mappings
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
- Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- On weak convergence of the Douglas-Rachford method
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- A simplified proof of weak convergence in Douglas-Rachford method
- Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem
- An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
- Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- An introduction to continuous optimization for imaging
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
- On a new simple algorithm to compute the resolvents
- Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step
- A splitting method for finding the resolvent of the sum of two maximal monotone operators
This page was built for publication: On the convergence rate of Douglas-Rachford operator splitting method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747781)
