Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem
From MaRDI portal
Publication:2679568
Recommendations
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- Inexact operator splitting method for monotone inclusion problems
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions
Cites work
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- A family of operator splitting methods revisited
- Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- Conical averagedness and convergence analysis of fixed point algorithms
- Convergence rate analysis of several splitting schemes
- Convergence rate analysis of the forward-Douglas-Rachford splitting scheme
- Convex analysis and monotone operator theory in Hilbert spaces
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Iterative construction of the resolvent of a sum of maximal monotone operators
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the convergence rate of Douglas-Rachford operator splitting method
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
Cited in
(7)- Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- On monotone convergence of nonlinear multisplitting relaxation methods
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
This page was built for publication: Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679568)
