On broyden's method for the regularization of nonlinear ill-posed problems
From MaRDI portal
Publication:4221448
DOI10.1080/01630569808816860zbMath0914.65066MaRDI QIDQ4221448
Publication date: 7 June 1999
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569808816860
convergence; numerical tests; Hilbert spaces; nonlinear ill-posed problems; stopping rule; quasi-Newton method; Broyden's method; iterative regularization methods
47J25: Iterative procedures involving nonlinear operators
65J15: Numerical solutions to equations with nonlinear operators
65J20: Numerical solutions of ill-posed problems in abstract spaces; regularization
Related Items
Regularized Versions of Continuous Newton's Method and Continuous Modified Newton's Method Under General Source Conditions, A generalization of continuous regularized Gauss–Newton method for ill-posed problems, Lavrentiev's regularization method in Hilbert spaces revisited, A two-stage method for nonlinear inverse problems, Iterative Solution Methods, Iterative Regularization and Generalized Discrepancy Principle for Monotone Operator Equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of Newton-like methods for singular operator equations using outer inverses
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- Convergence rates for Tikhonov regularisation of non-linear ill-posed problems
- Broyden's method in Hilbert space
- Phase reconstruction via nonlinear least-squares
- Asymptotic Mesh Independence of Newton–Galerkin Methods via a Refined Mysovskii Theorem
- Quasi-Newton Methods, Motivation and Theory
- Affine Invariant Convergence Theorems for Newton’s Method and Extensions to Related Methods
- Some Newton-type methods for the regularization of nonlinear ill-posed problems
- Regularizing properties of a truncated newton-cg algorithm for nonlinear inverse problems
