A study of frozen iteratively regularized Gauss-Newton algorithm for nonlinear ill-posed problems under generalized normal solvability condition
From MaRDI portal
Publication:1987129
Recommendations
- On a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
- On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
- A generalization of continuous regularized Gauss-Newton method for ill-posed problems
- Convergence analysis of an inexact iteratively regularized Gauss-Newton method under general source conditions
- On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems
Cites work
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- A simplified generalized Gauss-Newton method for nonlinear ill-posed problems
- Bootstrap methods for standard errors, confidence intervals, and other measures of statistical accuracy
- Convergence analysis of simplified iteratively regularized Gauss–Newton method in a Banach space setting
- Convergence and application of a modified iteratively regularized Gauss–Newton algorithm
- Convergence of projected iterative regularization methods for nonlinear problems with smooth solutions
- Convergence rates for Tikhonov regularisation of non-linear ill-posed problems
- scientific article; zbMATH DE number 3954180 (Why is no real title available?)
- scientific article; zbMATH DE number 803211 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Ill-posed problems with a priori information
- Iterative methods for ill-posed problems. An introduction.
- Iterative regularization methods for nonlinear ill-posed problems
- Iterative Solution Methods
- 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
- Numerical Optimization
- On a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
- On convergence rates for iteratively regularized procedures with linear penalty terms
- On convergence rates for the iteratively regularized Gauss-newton method
- Some generalizations for Landweber iteration for nonlinear ill-posed problems in Hilbert scales
- Some Newton-type methods for the regularization of nonlinear ill-posed problems
Cited in
(7)- Convergence analysis of iteratively regularized Gauss-Newton method with frozen derivative in Banach spaces
- Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems
- On a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
- The data filtering based multiple‐stage Levenberg–Marquardt algorithm for Hammerstein nonlinear systems
- Convergence analysis of inexact Newton-Landweber iteration with frozen derivative in Banach spaces
- A modified iteratively regularized Landweber iteration method: Hölder stability and convergence rates
- Simplified iterated Lavrentiev regularization in Hilbert scales
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1987129)