On the convergence rate of Douglas-Rachford operator splitting method
From MaRDI portal
Publication:747781
DOI10.1007/S10107-014-0805-XzbMath1327.90211OpenAlexW2050137601MaRDI QIDQ747781
Publication date: 19 October 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0805-x
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)
Related Items (35)
On non-ergodic convergence rate of the operator splitting method for a class of variational inequalities ⋮ A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions ⋮ Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator ⋮ Convergence rates with inexact non-expansive operators ⋮ A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging ⋮ A Dynamical Splitting Method for Minimizing the Sum of Three Convex Functions ⋮ A dual split Bregman method for fast $\ell ^1$ minimization ⋮ A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ Unnamed Item ⋮ Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem ⋮ Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\) ⋮ Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ An endeavor from the Glowinski-Le Tallec splitting for approximating the solution of Kawarada equation ⋮ On a new simple algorithm to compute the resolvents ⋮ From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems ⋮ A unified and tight linear convergence analysis of the relaxed proximal point algorithm ⋮ Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions ⋮ The Glowinski-Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces ⋮ Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems ⋮ On the optimal relaxation parameters of Krasnosel'ski–Mann iteration ⋮ An introduction to continuous optimization for imaging ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators ⋮ Convergence Rate Analysis of Inertial Krasnoselskii–Mann Type Iteration with Applications ⋮ A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators ⋮ Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods ⋮ Generalized alternating direction method of multipliers: new theoretical insights and applications ⋮ ON THE CONVERGENCE RATE OF THE KRASNOSEL’SKIĬ–MANN ITERATION ⋮ New strong convergence method for the sum of two maximal monotone operators ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem ⋮ Local saddles of relaxed averaged alternating reflections algorithms on phase retrieval ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- Monotone (nonlinear) operators in Hilbert space
- 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
- Self-adaptive operator splitting methods for monotone variational inequalities
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- Interior projection-like methods for monotone variational inequalities
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Proximité et dualité dans un espace hilbertien
- Convex analysis and monotone operator theory in Hilbert spaces
- Set-valued analysis
This page was built for publication: On the convergence rate of Douglas-Rachford operator splitting method
