A study of frozen iteratively regularized Gauss-Newton algorithm for nonlinear ill-posed problems under generalized normal solvability condition
From MaRDI portal
Publication:1987129
DOI10.1515/jiip-2019-0099zbMath1433.65106OpenAlexW3006053133MaRDI QIDQ1987129
Alexandra B. Smirnova, Anatoly B. Bakushinsky
Publication date: 9 April 2020
Published in: Journal of Inverse and Ill-Posed Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jiip-2019-0099
Ill-posedness and regularization problems in numerical linear algebra (65F22) Ill-posed problems for PDEs (35R25) Nonlinear ill-posed problems (47J06) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items (3)
The data filtering based multiple‐stage Levenberg–Marquardt algorithm for Hammerstein nonlinear systems ⋮ Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems ⋮ Convergence analysis of iteratively regularized Gauss-Newton method with frozen derivative in Banach spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some generalizations for Landweber iteration for nonlinear ill-posed problems in Hilbert scales
- Iteratively regularized Gauss-Newton method for operator equations with normally solvable derivative at the solution
- Iteratively regularized methods for irregular nonlinear operator equations with a normally solvable derivative at the solution
- Iterative methods for ill-posed problems. An introduction.
- Iterative regularization methods for nonlinear ill-posed problems
- Bootstrap methods for standard errors, confidence intervals, and other measures of statistical accuracy
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- Ill-posed problems with a priori information
- Iterative Solution Methods
- A simplified generalized Gauss-Newton method for nonlinear ill-posed problems
- On a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
- On convergence rates for iteratively regularized procedures with linear penalty terms
- Convergence rates for Tikhonov regularisation of non-linear ill-posed problems
- Numerical Optimization
- On convergence rates for the iteratively regularized Gauss-newton method
- Some Newton-type methods for the regularization of nonlinear ill-posed problems
- Convergence analysis of simplified iteratively regularized Gauss–Newton method in a Banach space setting
- Convergence of projected iterative regularization methods for nonlinear problems with smooth solutions
- Convergence and application of a modified iteratively regularized Gauss–Newton algorithm
This page was built for publication: A study of frozen iteratively regularized Gauss-Newton algorithm for nonlinear ill-posed problems under generalized normal solvability condition
