Solution to a Monotone Inclusion Problem using the Relaxed Peaceman-Rachford Splitting Method: Convergence and its Rates
Preprint
Abstract
We consider the convergence behavior using the relaxed Peaceman-Rachford splitting method to solve the monotone inclusion problem $0 \in (A + B)(u)$, where $A, B: \Re^n \rightrightarrows \Re^n$ are maximal $\beta$-strongly monotone operators, $n \geq 1$ and $\beta > 0$. Under a technical assumption, convergence of iterates using the method on the problem is proved when either $A$ or $B$ is single-valued, and the fixed relaxation parameter $\theta$ lies in the interval $(2 + \beta, 2 + \beta + \min \{ \beta, 1/\beta \})$. With this convergence result, we address an open problem that is not settled in [20] on the convergence of these iterates for $\theta \in (2 + \beta, 2 + \beta + \min \{ \beta, 1/\beta\})$. Pointwise convergence rate results and $R$-linear convergence rate results when $\theta$ lies in the interval $[2 + \beta, 2 + \beta + \min \{ \beta, 1/\beta\})$ are also provided in the paper. Our analysis to achieve these results is atypical and hence novel. Numerical experiments are conducted on the weighted Lasso minimization problem to test the validity of the assumption .
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Conical averagedness and convergence analysis of fixed point algorithmsJournal of Global Optimization, 2021
- Complexity of the relaxed Peaceman–Rachford splitting method for the sum of two maximal strongly monotone operatorsComputational Optimization and Applications, 2018
- Tight global linear convergence rate bounds for Douglas–Rachford splittingJournal of Fixed Point Theory and Applications, 2017
- Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two SubspacesNumerical Algorithms, 2015
- Linear and strong convergence of algorithms involving averaged nonexpansive operatorsJournal of Mathematical Analysis and Applications, 2015
- On the convergence rate of Douglas–Rachford operator splitting methodMathematical Programming, 2014
- The rate of linear convergence of the Douglas–Rachford algorithm for subspaces is the cosine of the Friedrichs angleJournal of Approximation Theory, 2014
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraintsJournal of Mathematical Analysis and Applications, 1967