A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem (Q2188095)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7207986
Language Label Description Also known as
default for all languages
No label defined
    English
    A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem
    scientific article; zbMATH DE number 7207986

      Statements

      A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem (English)
      0 references
      3 June 2020
      0 references
      Summary: In this article, we introduce a relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem. Firstly, we transfer the original problem to the constrained multiple-sets split equality problem and a fixed point equation system is established. Then, we show the equivalence of the constrained multiple-sets split equality problem and the fixed point equation system. Secondly, we present a relaxed self-adaptive projection algorithm for the fixed point equation system. The advantage of the self-adaptive step size is that it could be obtained directly from the iterative procedure. Furthermore, we prove the convergence of the proposed algorithm. Finally, several numerical results are shown to confirm the feasibility and efficiency of the proposed algorithm.
      0 references
      relaxed self-adaptive projection algorithm
      0 references
      multiple-sets split equality problem
      0 references
      strong convergence
      0 references
      weak convergence
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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