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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Numerical algorithms Ročník 87; číslo 3; s. 1075 - 1095
Hlavní autori:	Sahu, D.R., Cho, Y.J., Dong, Q.L., Kashyap, M.R., Li, X.H.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2021 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!