A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces
From MaRDI portal
Publication:5094632
DOI10.1137/21M1445181zbMath1492.65151MaRDI QIDQ5094632
Publication date: 4 August 2022
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
inverse problemsparameter identificationtomographyiteration regularizationconvex penaltyKaczmarz-type method
Systems of nonsingular linear integral equations (45F05) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items (2)
Convergence analysis of inexact Newton–Landweber iteration under Hölder stability ⋮ A Fast Data-Driven Iteratively Regularized Method with Convex Penalty for Solving Ill-Posed Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- On Levenberg-Marquardt-Kaczmarz iterative methods for solving systems of nonlinear ill-posed equations
- Iterative regularization methods for nonlinear ill-posed problems
- On steepest-descent-Kaczmarz methods for regularizing systems of nonlinear ill-posed equations
- Variational methods in imaging
- Linear convergence of the randomized sparse Kaczmarz method
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- Regularization of inverse problems by two-point gradient methods in Banach spaces
- Kaczmarz methods for regularizing nonlinear ill-posed equations. II: Applications
- Kaczmarz methods for regularizing nonlinear ill-posed equations. I: Convergence analysis
- Mathematical Methods in Image Reconstruction
- On projective Landweber–Kaczmarz methods for solving systems of nonlinear ill-posed equations
- An iterative regularization method for nonlinear problems based on Bregman projections
- Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
- The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
- A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
- A revisit on Landweber iteration
- Convergence rates for Tikhonov regularisation of non-linear ill-posed problems
- Tikhonov regularisation for non-linear ill-posed problems: optimal convergence rates and finite-dimensional approximation
- Accelerated Landweber iteration in Banach spaces
- Fast regularizing sequential subspace optimization in Banach spaces
- Convergence rates of convex variational regularization
- The Averaged Kaczmarz Iteration for Solving Inverse Problems
- Regularization Methods for Ill-Posed Problems
- An accelerated homotopy perturbation iteration for nonlinear ill-posed problems in Banach spaces with uniformly convex penalty
- The two-point gradient methods for nonlinear inverse problems based on Bregman projections
- A projective averaged Kaczmarz iteration for nonlinear ill-posed problems
- Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms
- A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
- Regularizing Newton--Kaczmarz Methods for Nonlinear Ill-Posed Problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- An Iteration Formula for Fredholm Integral Equations of the First Kind
This page was built for publication: A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces