Two-step inertial forward–reflected–anchored–backward splitting algorithm for solving monotone inclusion problems

Chinedu Izuchukwu*, Maggie Aphane, Kazeem Olalekan Aremu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The main purpose of this paper is to propose and study a two-step inertial anchored version of the forward–reflected–backward splitting algorithm of Malitsky and Tam in a real Hilbert space. Our proposed algorithm converges strongly to a zero of the sum of a set-valued maximal monotone operator and a single-valued monotone Lipschitz continuous operator. It involves only one forward evaluation of the single-valued operator and one backward evaluation of the set-valued operator at each iteration; a feature that is absent in many other available strongly convergent splitting methods in the literature. Finally, we perform numerical experiments involving image restoration problem and compare our algorithm with known related strongly convergent splitting algorithms in the literature.

Original languageEnglish
Article number351
JournalComputational and Applied Mathematics
Volume42
Issue number8
DOIs
Publication statusPublished - Dec 2023

Keywords

  • Forward–reflected–backward method
  • Halpern’s iteration
  • Monotone inclusion
  • Strong convergence
  • Two-step inertial

Fingerprint

Dive into the research topics of 'Two-step inertial forward–reflected–anchored–backward splitting algorithm for solving monotone inclusion problems'. Together they form a unique fingerprint.

Cite this