A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings (Q1736800)

From MaRDI portal





scientific article; zbMATH DE number 7042346
Language Label Description Also known as
default for all languages
No label defined
    English
    A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings
    scientific article; zbMATH DE number 7042346

      Statements

      A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      26 March 2019
      0 references
      Summary: In this article, we introduce a new multi-step iteration for approximating a common fixed point of a finite class of multi-valued Bregman relatively nonexpansive mappings in the setting of reflexive Banach spaces. We prove a strong convergence theorem for the proposed iterative algorithm under certain hypotheses. Additionally, we also use our results for the solution of variational inequality problems and to find the zero points of maximal monotone operators. The theorems furnished in this work are new and well-established and generalize many well-known recent research works in this field.
      0 references
      common fixed point
      0 references
      multi-valued Bregman relatively nonexpansive mapping
      0 references
      strong convergence
      0 references
      iterative methods
      0 references
      reflexive Banach spaces
      0 references
      variational inequality problems
      0 references
      maximal monotone
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references