Convergence analysis of simplified Gauss–Newton iterative method under a heuristic rule
From MaRDI portal
Publication:6500219
DOI10.1007/S12044-024-00777-3WikidataQ127254955 ScholiaQ127254955MaRDI QIDQ6500219FDOQ6500219
Authors: Pallavi Mahale, Ankit Singh
Publication date: 10 May 2024
Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)
Nonlinear ill-posed problems (47J06) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Cites Work
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Title not available (Why is that?)
- Iterative regularization methods for nonlinear ill-posed problems
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- On a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
- Title not available (Why is that?)
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- 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
- Convergence rates for Tikhonov regularisation of non-linear ill-posed problems
- Optimal a Posteriori Parameter Choice for Tikhonov Regularization for Solving Nonlinear Ill-Posed Problems
- The problem of the convergence of the iteratively regularized Gauss- Newton method
- On convergence rates for the iteratively regularized Gauss-newton method
- Logarithmic convergence rates of the iteratively regularized Gauss - Newton method for an inverse potential and an inverse scattering problem
- A Lepskij-type stopping rule for regularized Newton methods
- A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz condition
- A convergence analysis of iterative methods for the solution of nonlinear ill-posed problems under affinely invariant conditions
- On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
- On an a posteriori parameter choice strategy for Tikhonov regularization of nonlinear ill-posed problems
- Some Newton-type methods for the regularization of nonlinear ill-posed problems
- A posteriori parameter choice strategies for some Newton type methods for the regularization of nonlinear ill-posed problems
- On the choice of the regularization parameter for ordinary and iterated Tikhonov regularization of nonlinear ill-posed problems
- Weakly closed nonlinear operators and parameter identification in parabolic equations by tikhonov regularization
- Analysis of the iteratively regularized Gauss–Newton method under a heuristic rule
- Hanke-Raus heuristic rule for variational regularization in Banach spaces
- Further convergence results on the general iteratively regularized Gauss-Newton methods under the discrepancy principle
- Error estimates for the simplified iteratively regularized Gauss-Newton method under a general source condition
- Heuristic rule for non-stationary iterated Tikhonov regularization in Banach spaces
- Analysis of a generalized regularized Gauss–Newton method under heuristic rule in Banach spaces
This page was built for publication: Convergence analysis of simplified Gauss–Newton iterative method under a heuristic rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6500219)