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
From MaRDI portal
Publication:2322832
DOI10.1007/S11075-018-0604-1OpenAlexW2963758579WikidataQ129153692 ScholiaQ129153692MaRDI QIDQ2322832
M. Marques Alves, Marina Geremia
Publication date: 5 September 2019
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.11551
complexitysplittingmonotone operatorsTseng's forward-backward methodHPE methodinexact Douglas-Rachford method
Convex programming (90C25) Monotone operators and generalizations (47H05) Decomposition methods (49M27)
Related Items (9)
A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance ⋮ Inertial-relaxed splitting for composite monotone inclusions ⋮ A relaxed forward-backward-forward algorithm with alternated inertial step: weak and linear convergence ⋮ Douglas–Rachford algorithm for control-constrained minimum-energy control problems ⋮ Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems ⋮ Enlargements: a bridge between maximal monotonicity and convexity ⋮ Nonlinear Forward-Backward Splitting with Projection Correction ⋮ Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms ⋮ Convergence analysis of an inexact three-operator splitting algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adaptive accelerated first-order method for convex optimization
- A practical relative error criterion for augmented Lagrangians
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method
- Forward-partial inverse-forward splitting for solving monotone inclusions
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- A three-operator splitting scheme and its optimization applications
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Splitting Methods in Communication, Imaging, Science, and Engineering
- Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- On Weak Convergence of the Douglas–Rachford Method
- On the proximal point method for equilibrium problems in Hilbert spaces
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A Hybrid Proximal-Extragradient Algorithm with Inertial Effects
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Recent Developments on Primal–Dual Splitting Methods with Applications to Convex Minimization
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: 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
