The University of Southampton
University of Southampton Institutional Repository

Outer reflected forward–backward splitting algorithm with inertial extrapolation step

Outer reflected forward–backward splitting algorithm with inertial extrapolation step
Outer reflected forward–backward splitting algorithm with inertial extrapolation step

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 (Formula presented.) 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.

Three operator splitting, inertial extrapolation step, non-asymptotic convergence rate, weak and strong convergence
0233-1934
3901-3924
Shehu, Yekini
df727925-5bf0-457a-87fa-f70de3bfd11a
Jolaoso, Lateef O.
102467df-eae0-4692-8668-7f73e8e02546
Okeke, C.C.
051d0285-4fc7-4858-82cb-313d97c1b1a8
Xu, Renqi
fb90ad57-eb26-4750-90cc-ceef5cf90de7
Shehu, Yekini
df727925-5bf0-457a-87fa-f70de3bfd11a
Jolaoso, Lateef O.
102467df-eae0-4692-8668-7f73e8e02546
Okeke, C.C.
051d0285-4fc7-4858-82cb-313d97c1b1a8
Xu, Renqi
fb90ad57-eb26-4750-90cc-ceef5cf90de7

Shehu, Yekini, Jolaoso, Lateef O., Okeke, C.C. and Xu, Renqi (2024) Outer reflected forward–backward splitting algorithm with inertial extrapolation step. Optimization, 74 (15), 3901-3924. (doi:10.1080/02331934.2024.2391004).

Record type: Article

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 (Formula presented.) 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.

Text
Inertial Shadow - Accepted Manuscript
Download (3MB)

More information

Accepted/In Press date: 4 August 2024
e-pub ahead of print date: 14 August 2024
Keywords: Three operator splitting, inertial extrapolation step, non-asymptotic convergence rate, weak and strong convergence

Identifiers

Local EPrints ID: 511375
URI: http://eprints.soton.ac.uk/id/eprint/511375
ISSN: 0233-1934
PURE UUID: 14721529-4829-4dc4-98d1-d5fac75683c2
ORCID for Lateef O. Jolaoso: ORCID iD orcid.org/0000-0002-4838-7465

Catalogue record

Date deposited: 13 May 2026 16:41
Last modified: 14 May 2026 02:02

Export record

Altmetrics

Contributors

Author: Yekini Shehu
Author: C.C. Okeke
Author: Renqi Xu

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×