2022
DOI: 10.1137/21m1445181
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 38 publications
0
2
0
Order By: Relevance
“…The typical interior character of problem ( 1) is its ill-posedness, which means that the solution is highly sensitive to the slight change of the right hand side data y. In order to find a stable and rational solution, many regularization methods have been proposed during the past few decades (see, for example, [1][2][3][4][5]). Among these methods, iterative regularization methods show their activeness and are intensively focused for their stability and robust for inverse problems.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The typical interior character of problem ( 1) is its ill-posedness, which means that the solution is highly sensitive to the slight change of the right hand side data y. In order to find a stable and rational solution, many regularization methods have been proposed during the past few decades (see, for example, [1][2][3][4][5]). Among these methods, iterative regularization methods show their activeness and are intensively focused for their stability and robust for inverse problems.…”
Section: Introductionmentioning
confidence: 99%
“…., where µ n,k is the step size, ξ n,0 = ξ n and x n,0 = x n . The next iterate is then defined as ξ n+1 = ξ n,kn and x n+1 = x n,kn with the integer k n ⩾ 1 determined in the same way as the method (5). The convergence of the method ( 7) is given in [17].…”
Section: Introductionmentioning
confidence: 99%