Variable KM-like algorithms for fixed point problems and split feasibility problems

Abdul Latif*, Daya R. Sahu, Qamrul H. Ansari

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

The convergence analysis of a variable KM-like method for approximating common fixed points of a possibly infinitely countable family of nonexpansive mappings in a Hilbert space is proposed and proved to be strongly convergent to a common fixed point of a family of nonexpansive mappings. Our variable KM-like technique is applied to solve the split feasibility problem and the multiple-sets split feasibility problem. Especially, the minimum norm solutions of the split feasibility problem and the multiple-sets split feasibility problem are derived. Our results can be viewed as an improvement and refinement of the previously known results. MSC:47H10, 65J20, 65J22, 65J25.

Original languageEnglish
Article number211
JournalFixed Point Theory and Algorithms for Sciences and Engineering
Volume2014
Issue number1
DOIs
StatePublished - 18 Dec 2014

Bibliographical note

Publisher Copyright:
© 2014, Latif et al.; licensee Springer.

Keywords

  • convergence analysis of algorithms
  • fixed point problems
  • regularized algorithms
  • split feasibility problems

ASJC Scopus subject areas

  • Geometry and Topology
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Variable KM-like algorithms for fixed point problems and split feasibility problems'. Together they form a unique fingerprint.

Cite this