LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Two iterative algorithms for solving the split common fixed point problems

Photo from wikipedia

The purpose of this paper is to study the split common fixed point problems (SCFP) involved in nonexpansive mappings in real Hilbert space. We introduce two iterative algorithms for finding… Click to show full abstract

The purpose of this paper is to study the split common fixed point problems (SCFP) involved in nonexpansive mappings in real Hilbert space. We introduce two iterative algorithms for finding a solution of the SCFP involved in nonexpansive mappings, where one is a Mann-type iterative algorithm and another is a Halpern-type iterative algorithm.

Keywords: fixed point; two iterative; point problems; iterative algorithms; split common; common fixed

Journal Title: Filomat
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.