On computability and applicability of Mann-Reich-Sabach-type algorithms for approximating the solutions of equilibrium problems in Hilbert spaces (Q1728536)

From MaRDI portal





scientific article; zbMATH DE number 7029293
Language Label Description Also known as
default for all languages
No label defined
    English
    On computability and applicability of Mann-Reich-Sabach-type algorithms for approximating the solutions of equilibrium problems in Hilbert spaces
    scientific article; zbMATH DE number 7029293

      Statements

      On computability and applicability of Mann-Reich-Sabach-type algorithms for approximating the solutions of equilibrium problems in Hilbert spaces (English)
      0 references
      25 February 2019
      0 references
      Summary: We establish the existence of a strong convergent selection of a modified Mann-Reich-Sabach iteration scheme for approximating the common elements of the set of fixed points \(F(T)\) of a multivalued (or single-valued) \(k \)-strictly pseudocontractive-type mapping \(T\) and the set of solutions \(E P(F)\) of an equilibrium problem for a bifunction \(F\) in a real Hilbert space \(H\). This work is a continuation of the study on the computability and applicability of algorithms for approximating the solutions of equilibrium problems for bifunctions involving the construction of a sequence \(\{K_n \}_{n = 1}^{\infty}\) of closed convex subsets of \(H\) from an arbitrary \(x_0 \in H\) and a sequence \(\{x_n \}_{n = 1}^{\infty}\) of the metric projections of \(x_0\) into \(K_n\). The obtained result is a partial resolution of the controversy over the computability of such algorithms in the contemporary literature.
      0 references
      strong convergence
      0 references
      modified Mann-Reich-Sabach iteration scheme
      0 references
      fixed points
      0 references
      \(k \)-strictly pseudocontractive-type mappings
      0 references
      equilibrium problem
      0 references
      bifunctions
      0 references
      real Hilbert spaces
      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