Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions
From MaRDI portal
Publication:5861973
DOI10.1080/01630563.2021.2001749OpenAlexW3212961292MaRDI QIDQ5861973FDOQ5861973
Authors: Jingjing Fan, Xiaolong Qin, Bing Tan
Publication date: 3 March 2022
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2021.2001749
monotone inclusioninertial algorithmthree-operator splittingshadow Douglas-Rachford splitting algorithm
Cites Work
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Convex analysis and monotone operator theory in Hilbert spaces
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Convergence of a splitting inertial proximal method for monotone operators
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A primal-dual splitting algorithm for finding zeros of sums of maximal monotone operators
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- A forward-backward splitting method for monotone inclusions without cocoercivity
- On weak convergence of the Douglas-Rachford method
- An inertial forward-backward algorithm for monotone inclusions
- A convergence theorem for generalized mixed equilibrium problems and multivalued asymptotically nonexpansive mappings
- A dynamical system associated with the fixed points set of a nonexpansive operator
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- Tseng type methods for solving inclusion problems and its applications
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- Shadow Douglas-Rachford splitting for monotone inclusions
- Convergence analysis of a variable metric forward-backward splitting algorithm with applications
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- A neural network method for monotone variational inclusions
- A hybrid steepest descent method for solving split feasibility problems involving nonexpansive mappings
- Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems
- Convergence analysis of an inertial Tseng's extragradient algorithm for solving pseudomonotone variational inequalities and applications
- Generalized Dubovitskii-Milyutin approach in set-valued optimization
Cited In (3)
- Three-operator reflected forward-backward splitting algorithm with double inertial effects
- Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions
- 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
This page was built for publication: Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5861973)