Heuristic rule for inexact Newton-Landweber iteration with convex penalty terms of nonlinear: ill-posed problems
From MaRDI portal
Publication:6101032
DOI10.1088/1361-6420/acccdbzbMath1515.65139MaRDI QIDQ6101032
Ruixue Gu, Hongsun Fu, Zhenwu Fu, Bo Han
Publication date: 31 May 2023
Published in: Inverse Problems (Search for Journal in Brave)
nonlinear ill-posed problemsLandweber iterationheuristic ruleconvex penaltyinexact Newton regularization methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the order optimality of the regularization via inexact Newton iterations
- Regularization methods in Banach spaces.
- Towards a general convergence theory for inexact Newton regularizations
- Nonsmooth analysis
- Iterative regularization methods for nonlinear ill-posed problems
- On the convergence of the quasioptimality criterion for (iterated) Tikhonov regularization
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- Inexact Newton regularization in Banach spaces based on two-point gradient method with uniformly convex penalty terms
- Bouligand-Landweber iteration for a non-smooth ill-posed problem
- Regularization of inverse problems by two-point gradient methods in Banach spaces
- On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method
- Error estimates for the iteratively regularized Newton-Landweber method in Banach spaces under approximate source conditions
- Hanke-Raus heuristic rule for variational regularization in Banach spaces
- Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
- Inexact Newton–Landweber iteration for solving nonlinear inverse problems in Banach spaces
- A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
- Iterative regularization with a general penalty term—theory and application to L 1 and TV regularization
- Inexact Newton--Landweber Iteration in Banach Spaces with NonSmooth Convex Penalty Terms
- Iterative methods for nonlinear ill-posed problems in Banach spaces: convergence and applications to parameter identification problems
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- On the regularization of nonlinear ill-posed problems via inexact Newton iterations
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Regularizing properties of a truncated newton-cg algorithm for nonlinear inverse problems
- Analysis of the iteratively regularized Gauss–Newton method under a heuristic rule
- Heuristic rule for non-stationary iterated Tikhonov regularization in Banach spaces
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- Convergence rates for an iteratively regularized Newton–Landweber iteration in Banach space
- Sparsity regularization for parameter identification problems
- Generalized inexact Newton regularization for nonlinear ill-posed problems in Banach spaces
- A Kaczmarz Version of the REGINN-Landweber Iteration for Ill-Posed Problems in Banach Spaces
- Inexact Newton Regularization Using Conjugate Gradients as Inner Iteration
- Analysis of a generalized regularized Gauss–Newton method under heuristic rule in Banach spaces
- On convergence rates of inexact Newton regularizations
This page was built for publication: Heuristic rule for inexact Newton-Landweber iteration with convex penalty terms of nonlinear: ill-posed problems