MARATTO

article · Optimization

Outer reflected forward–backward splitting algorithm with inertial extrapolation step

Abstract

This paper studies an outer reflected forward–backward splitting algorithm with an inertial step to find a zero of the sum of three monotone operators composing the maximal monotone operator, Lipschitz monotone operator, and a cocoercive operator in real Hilbert spaces. One of the interesting features of the proposed method is that both the Lipschitz monotone operator and the cocoercive operator are computed explicitly each with one evaluation per iteration. We obtain weak and strong convergence results under some easy-to-verify assumptions. We also obtain a non-asymptotic O(1/n) convergence rate of our proposed algorithm in a non-ergodic sense. We finally give some numerical illustrations arising from compressed sensing and image processing and show that our proposed method is effective and competitive with other related methods in the literature.

Research topics

  • Numerical methods in inverse problems
  • Sparse and Compressive Sensing Techniques
  • Photoacoustic and Ultrasonic Imaging

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.1080/02331934.2024.2391004

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.