A Modified Halpern's Iterative Scheme for Solving Split Feasibility Problems | Zendy

Jitsupa Deepho | Zendy; Poom Kumam | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Modified Halpern's Iterative Scheme for Solving Split Feasibility Problems

Author(s) -

Jitsupa Deepho,

Poom Kumam

Publication year - 2012

Publication title -

abstract and applied analysis

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.228

H-Index - 56

eISSN - 1687-0409

pISSN - 1085-3375

DOI - 10.1155/2012/876069

Subject(s) - mathematics , hilbert space , scheme (mathematics) , convergence (economics) , iterative method , inverse , space (punctuation) , mathematical optimization , inverse problem , mathematical analysis , computer science , geometry , economics , economic growth , operating system

The purpose of this paper is to introduce and study a modified Halpern’s iterative scheme for solving the split feasibility problem (SFP) in the setting of infinite-dimensional Hilbert spaces. Under suitable conditions a strong convergence theorem is established. The main result presented in this paper improves and extends some recent results done by Xu (Iterative methods for the split feasibility problem in infinite-dimensional Hilbert space, Inverse Problem 26 (2010) 105018) and some others

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research