Theoretical and Numerical Study of Iteratively Truncated Newton’s Algorithm
DOI10.1007/978-1-4614-7816-4_1zbMATH Open1279.65073OpenAlexW139097082MaRDI QIDQ2863528FDOQ2863528
Authors: Hui Liu, A. B. Bakushinskii, Alexandra Smirnova 
Publication date: 22 November 2013
Published in: Applied Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-7816-4_1
Recommendations
- A survey of truncated-Newton methods
- Numerical experience with the truncated Newton method for unconstrained optimization
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
- On a general iterative scheme for newton-type methods
- A class of generalized Newton iterative schemes
- scientific article; zbMATH DE number 1568984
- Truncated multidimensional Newton's method
- The generalization and improvement of Newton-type iterative method
- Truncated Newton methods for optimization with inaccurate functions and gradients
regularizationconvergencenumerical examplesstabilityalgorithmstopping ruleill-posed problemNewton's methodintegral equation of the first kindnonlinear inverse magnetometry problemspectral cutoff
Numerical methods for integral equations (65R20) Other nonlinear integral equations (45G10) Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22)
Cites Work
- Numerical Optimization
- Iterative regularization methods for nonlinear ill-posed problems
- Ill-posed problems with a priori information
- ON APPLICATION OF GENERALIZED DISCREPANCY PRINCIPLE TO ITERATIVE METHODS FOR NONLINEAR ILL-POSED PROBLEMS
- Hessian Matrix vs. Gauss–Newton Hessian Matrix
- 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
- Methods for inverse magnetometry problem solving
- A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz condition
- Iteratively Regularized Gauss–Newton Method for Nonlinear Inverse Problems with Random Noise
- Improving the Gauss–Newton convergence of a certain position registration scheme
- Convergence and application of a modified iteratively regularized Gauss–Newton algorithm
- Investigation of preconditioning techniques for the iteratively regularized Gauss-Newton method for exponentially ill-posed problems
- Iterative processes of gradient type with applications to gravimetry and magnetometry inverse problems
Cited In (2)
This page was built for publication: Theoretical and Numerical Study of Iteratively Truncated Newton’s Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863528)
