Analysis of the iteratively regularized Gauss–Newton method under a heuristic rule
From MaRDI portal
Publication:4634752
Cites work
- scientific article; zbMATH DE number 3686059 (Why is no real title available?)
- scientific article; zbMATH DE number 107974 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- A Lepskij-type stopping rule for regularized Newton methods
- A convergence analysis of iterative methods for the solution of nonlinear ill-posed problems under affinely invariant conditions
- A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz condition
- A general convergence analysis of some Newton-type methods for nonlinear inverse problems
- A posteriori parameter choice strategies for some Newton type methods for the regularization of nonlinear ill-posed problems
- About a deficit in low-order convergence rates on the example of autoconvolution
- Convergence rates for Tikhonov regularisation of non-linear ill-posed problems
- Further convergence results on the general iteratively regularized Gauss-Newton methods under the discrepancy principle
- Hanke-Raus heuristic rule for variational regularization in Banach spaces
- How general are general source conditions?
- Iterative regularization methods for nonlinear ill-posed problems
- Iterative solution of large sparse systems of equations
- Logarithmic convergence rates of the iteratively regularized Gauss - Newton method for an inverse potential and an inverse scattering problem
- On autoconvolution and regularization
- On convergence rates for the iteratively regularized Gauss-newton method
- On the convergence of the quasioptimality criterion for (iterated) Tikhonov regularization
- On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems
- On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
- On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems
- Optimality for ill-posed problems under general source conditions
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- Some Newton-type methods for the regularization of nonlinear ill-posed problems
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- The problem of the convergence of the iteratively regularized Gauss- Newton method
Cited in
(14)- Iterative Lavrentiev regularization method under a heuristic rule for nonlinear ill-posed operator equations
- A numerical Haar wavelet-finite difference hybrid method and its convergence for nonlinear hyperbolic partial differential equation
- Hanke-Raus rule for Landweber iteration in Banach spaces
- Analysis of a heuristic rule for the IRGNM in Banach spaces with convex regularization terms
- Landweber-type method with uniformly convex constraints under conditional stability assumptions
- Convergence analysis of simplified Gauss–Newton iterative method under a heuristic rule
- A discretizing Tikhonov regularization method via modified parameter choice rules
- On iteratively regularized predictor-corrector algorithm for parameter identification
- A discretizing Levenberg-Marquardt scheme for solving nonlinear ill-posed integral equations
- Heuristic parameter choice rule for solving linear ill-posed integral equations in finite dimensional space
- On stable parameter estimation and short-term forecasting with quantified uncertainty with application to COVID-19 transmission
- A projected Bouligand–Landweber iteration for non-smooth ill-posed problems
- Heuristic rule for inexact Newton-Landweber iteration with convex penalty terms of nonlinear: ill-posed problems
- Analysis of a generalized regularized Gauss-Newton method under heuristic rule in Banach spaces
This page was built for publication: Analysis of the iteratively regularized Gauss–Newton method under a heuristic rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634752)
