A New Gradient Method for Ill-Posed Problems
DOI10.1080/01630563.2017.1414061zbMath1486.65056OpenAlexW2775344568MaRDI QIDQ4639213
Publication date: 3 May 2018
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2017.1414061
gradient methodsdiscrepancy principlestopping ruleLandweber iterationsteepest descent methodminimal error methodlinear and nonlinear ill-posed problems
Nonlinear ill-posed problems (47J06) Numerical methods for ill-posed problems for integral equations (65R30) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)
Related Items (7)
Cites Work
- Some generalizations for Landweber iteration for nonlinear ill-posed problems in Hilbert scales
- The instability of some gradient methods for ill-posed problems
- Iterative regularization methods for nonlinear ill-posed problems
- Convergence rate results for steepest descent type method for nonlinear ill-posed equations
- A convergence rate result for a steepest descent method and a minimal error method for the solution of nonlinear ill-posed problems
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- On Landweber iteration for nonlinear ill-posed problems in Hilbert scales
- An analysis of a multi-level projected steepest descent iteration for nonlinear inverse problems in Banach spaces subject to stability constraints
- On projective Landweber–Kaczmarz methods for solving systems of nonlinear ill-posed equations
- A Note on the Nonlinear Landweber Iteration
- Unnamed Item
- Unnamed Item
This page was built for publication: A New Gradient Method for Ill-Posed Problems