Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces

The split feasibility problem is to find a point x ∗ with the property that x ∗ ∈ C and A x ∗ ∈ Q , where C and Q are nonempty closed convex subsets of real Hilbert spaces X and Y , respectively, and A is a bounded linear operator from X to Y . The split feasibility problem models inverse problems a...

Full description

Saved in:

Bibliographic Details
Published in:	Numerical algorithms Vol. 87; no. 3; pp. 1075 - 1095
Main Authors:	Sahu, D.R., Cho, Y.J., Dong, Q.L., Kashyap, M.R., Li, X.H.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2021 Springer Nature B.V
Subjects:	Algebra Algorithms Codes Computer Science Feasibility Hilbert space Inverse problems Linear operators Numeric Computing Numerical Analysis Original Paper Phase retrieval Radiation therapy Theory of Computation Weak convergence 65K05 CQ algorithm 49J52 65K10 Inertial technique Split feasibility problem Self-adaptive algorithm
ISSN:	1017-1398, 1572-9265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!