An Inertial Iterative Algorithm with Strong Convergence for Solving Modified Split Feasibility Problem in Banach Spaces | Zendy

Huijuan Jia | Zendy; Shufen Liu | Zendy; Yazheng Dang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Inertial Iterative Algorithm with Strong Convergence for Solving Modified Split Feasibility Problem in Banach Spaces

Author(s) -

Huijuan Jia,

Shufen Liu,

Yazheng Dang

Publication year - 2021

Publication title -

journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.252

H-Index - 13

eISSN - 2314-4785

pISSN - 2314-4629

DOI - 10.1155/2021/9974351

Subject(s) - mathematics , banach space , monotonic function , monotone polygon , convergence (economics) , sequence (biology) , fixed point , inertial frame of reference , spectral radius , algorithm , iterative method , operator (biology) , weak convergence , discrete mathematics , mathematical analysis , eigenvalues and eigenvectors , geometry , computer science , physics , economics , gene , computer security , repressor , asset (computer security) , economic growth , chemistry , biology , genetics , biochemistry , quantum mechanics , transcription factor

In this paper, we propose an iterative scheme for a special split feasibility problem with the maximal monotone operator and fixed-point problem in Banach spaces. The algorithm implements Halpern’s iteration with an inertial technique for the problem. Under some mild assumption of the monotonicity of the related mapping, we establish the strong convergence of the sequence generated by the algorithm which does not require the spectral radius of A T A. Finally, the numerical example is presented to demonstrate the efficiency of the algorithm.

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