On pseudo—optimal parameter choices and stopping rules for regularization methods in banach spaces∗
DOI10.1080/01630569608816690zbMATH Open0865.65039OpenAlexW1505050097MaRDI QIDQ4886623FDOQ4886623
Authors: Robert Plato, Uno Hämarik
Publication date: 10 July 1997
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569608816690
Recommendations
- On pseudo-optimal parameter choice in Tikhonov regularization
- Iterative methods for nonlinear ill-posed problems in Banach spaces: convergence and applications to parameter identification problems
- On the a posteriori parameter choice in regularization methods
- Regularization of ill-posed problems: Optimal parameter choice in finite dimensions
- scientific article; zbMATH DE number 949736
iterative methodsBanach spacesdiscrepancy principleregularization methodsRichardson iterationstopping rulespseudo-optimal parameter choices
Numerical methods for integral equations (65R20) Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Fredholm integral equations (45B05) Numerical methods for ill-posed problems for integral equations (65R30) Numerical solutions to equations with linear operators (65J10)
Cites Work
- Semigroups of linear operators and applications to partial differential equations
- Resolvent estimates for Abel integral operators and the regularization of associated first kind integral equations
- An a posteriori parameter choice for ordinary and iterated Tikhonov regularization of ill-posed problems leading to optimal convergence rates
- Inner, outer, and generalized inverses in banach and hilbert spaces
- A posteriori parameter choice for general regularization methods for solving linear ill-posed problems
- On the discrepancy principle for iterative and parametric methods to solve linear ill-posed equations
Cited In (9)
- On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
- Ill-posed problems, \(C_{0}\)-semigroups and the Showalter regularization
- Solving large-scale constrained least-squares problems.
- Use of extrapolation in regularization methods
- The Galerkin scheme for Lavrentiev's \(m\)-times iterated method to solve linear accretive Volterra integral equations of the first kind
- Convergence rates for Kaczmarz-type regularization methods
- Padé iteration method for regularization
- A discrete scheme of Landweber iteration for solving nonlinear ill-posed problems
- Converse Results, Saturation and Quasi-optimality for Lavrentiev Regularization of Accretive Problems
This page was built for publication: On pseudo—optimal parameter choices and stopping rules for regularization methods in banach spaces∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886623)