A modified Halpern algorithm for approximating a common solution of split equality convex minimization problem and fixed point problem in uniformly convex Banach spaces

A. Taiwo, L. O. Jolaoso, O. T. Mewomo*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

41 Citations (Scopus)

Abstract

In this paper, we introduce a modified Halpern algorithm for approximating a common solution of split equality convex minimization problem and split-equality fixed-point problem for Bregman quasi-nonexpansive mappings in p-uniformly convex and uniformly smooth Banach spaces. We introduce a generalized step size such that the algorithm does not require a prior knowledge of the operator norms and prove a strong convergence theorem for the sequence generated by our algorithm. We give some applications and numerical examples to show the consistency and accuracy of our algorithm. Our results complement and extend many other recent results in this direction in literature.

Original languageEnglish
Article number77
JournalComputational and Applied Mathematics
Volume38
Issue number2
DOIs
Publication statusPublished - 1 Jun 2019
Externally publishedYes

Keywords

  • Bregman quasi-nonexpansive
  • Fixed point problem
  • Minimization problem
  • Proximal operator
  • Split equality problem
  • Split feasibility problem

Fingerprint

Dive into the research topics of 'A modified Halpern algorithm for approximating a common solution of split equality convex minimization problem and fixed point problem in uniformly convex Banach spaces'. Together they form a unique fingerprint.

Cite this