Yayın:
PICARD TYPE ITERATIVE METHOD WITH APPLICATIONS TO MINIMIZATION PROBLEMS AND SPLIT FEASIBILITY PROBLEMS

Basit öğe sayfası
dc.contributor.authorErturk, M.
dc.contributor.authorGursoy, Faik
dc.contributor.authorAnsari, Qamrul Hasan
dc.contributor.authorKarakaya, Vatan
dc.date.accessioned2026-06-27T14:26:32Z
dc.date.issued2020
dc.description.abstractIn this paper, we study convergence analysis of a Picard type iterative algorithm for finding fixed points of nonexpansive mappings in the setting of Hilbert spaces. As an application of our result, we propose a new gradient projection algorithm for solving convex minimization problems and derive weak convergence result of such algorithm. An example is presented to illustrate our algorithm and result. As another application of our result, we present an algorithm for solving split feasibility problems and discuss the weak convergence of the algorithm.en
dc.identifier.eissn1880-5221
dc.identifier.endpage951
dc.identifier.issn1345-4773
dc.identifier.issue4
dc.identifier.startpage943
dc.identifier.urihttps://hdl.handle.net/20.500.14981/60665
dc.identifier.volume21
dc.identifier.wos000544577800016
dc.language.isoeng
dc.publisherYOKOHAMA PUBL
dc.relation.conferenceInternational Workshop on Nonlinear and Variational Analysis (IWNVA)
dc.relation.ispartofJOURNAL OF NONLINEAR AND CONVEX ANALYSIS
dc.subjectConvex minimization problems
dc.subjectfixed point problems
dc.subjectsplit feasibility problems
dc.subjectgradient projection method
dc.subjectpicard type iterative methods
dc.subjectconvergence analysis
dc.subjectALGORITHM
dc.subjectMathematics
dc.titlePICARD TYPE ITERATIVE METHOD WITH APPLICATIONS TO MINIMIZATION PROBLEMS AND SPLIT FEASIBILITY PROBLEMS
dc.typeArticle; Proceedings Paper
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar