An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces

In this work, we introduce an inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces. The main advantages of the proposed algorithm are that the introduced stepsize is bounded away from zero and a strong convergence theorem for our method is established without a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of applied mathematics & computing Ročník 68; číslo 3; s. 1699 - 1717
Hlavní autoři: Ma, Xiaojun, Liu, Hongwei
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2022
Springer Nature B.V
Témata:
Algorithms
Applied mathematics
Computational Mathematics and Numerical Analysis
Feasibility
Hilbert space
Mathematical analysis
Mathematical and Computational Engineering
Mathematics
Mathematics and Statistics
Mathematics of Computing
Operators (mathematics)
Original Research
Theory of Computation
Strong convergence
47J20
65K05
65K10
Split feasibility problem
47J25
Halpern-type CQ algorithm
Lipschitz continuity
ISSN:1598-5865, 1865-2085
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this work, we introduce an inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces. The main advantages of the proposed algorithm are that the introduced stepsize is bounded away from zero and a strong convergence theorem for our method is established without assuming Lipschitz continuity of the gradient operator. Some preliminary numerical experiments are provided for illustration and comparison.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1598-5865
1865-2085
DOI:10.1007/s12190-021-01585-y