A new splitting method for monotone inclusions of three operators
- 136 Downloads
In this article, we consider monotone inclusions in real Hilbert spaces and suggest a new splitting method. The associated monotone inclusions consist of the sum of one bounded linear monotone operator and one inverse strongly monotone operator and one maximal monotone operator. The new method, at each iteration, first implements one forward–backward step as usual and next implements a descent step, and it can be viewed as a variant of a proximal-descent algorithm in a sense. Its most important feature is that, at each iteration, it needs evaluating the inverse strongly monotone part once only in the forward–backward step and, in contrast, the original proximal-descent algorithm needs evaluating this part twice both in the forward–backward step and in the descent step. Moreover, unlike a recent work, we no longer require the adjoint operation of this bounded linear monotone operator in the descent step. Under standard assumptions, we analyze weak and strong convergence properties of this new method. Rudimentary experiments indicate the superiority of our suggested method over several recently-proposed ones for our test problems.
KeywordsMonotone inclusions Self-adjoint operator Inverse strongly monotone Splitting method Weak convergence
Mathematics Subject Classification58E35 65K15
We are very grateful to Xixian Bai at Shandong University for his help in numerical experiments.
- 10.Dong, Y.D.: Splitting Methods for Monotone Inclusions. Ph.D. dissertation, Nanjing University (2003)Google Scholar
- 24.Briceno-Arias, L.M., Davis, D.: Forward-backward-half forward algorithm with non self-adjoint linear operators for solving monotone inclusions. arXiv:1703.03436 (2017)