A posteriori parameter choice for general regularization methods for solving linear ill-posed problems
From MaRDI portal
Publication:1104704
DOI10.1016/0168-9274(88)90017-7zbMath0647.65038OpenAlexW2085360454MaRDI QIDQ1104704
Publication date: 1988
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(88)90017-7
Hilbert spacegeneralized inverseTikhonov regularizationill-posed problemsoptimal convergence ratesregularization methodssingular value expansiona posteriori parameter choice strategyLandweber- Fridman iteration
Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)
Related Items
Deconvolution and regularization for numerical solutions of incorrectly posed problems, Compact discrepancy and chi-squared principles for over-determined inverse problems, On the regularization of projection methods for solving ill-posed problems, Regularization of ill-posed problems: Optimal parameter choice in finite dimensions, On the Convergence of a Heuristic Parameter Choice Rule for Tikhonov Regularization, Characterizations of Variational Source Conditions, Converse Results, and Maxisets of Spectral Regularization Methods, On the discretization and regularization of ill-posed problems with noncompact operators, On the discrepancy principle and generalised maximum likelihood for regularisation, An a posteriori parameter choice for Tikhonov regularization in the presence of modeling error, On pseudo—optimal parameter choices and stopping rules for regularization methods in banach spaces∗, Numerical Homogenization and Model Order Reduction for Multiscale Inverse Problems, Distribution of event times in time-resolved fluorescence: The exponential series approach --- algorithm, regularization, analysis, A new \textit{a posteriori} parameter choice strategy for the convolution regularization of the space-fractional backward diffusion problem, Uniform convergence of regularization methods for linear ill-posed problems, Spectral methods for linear inverse problems with unbounded operators, Multilevel algorithms for ill-posed problems, Comparing parameter choice methods for regularization of ill-posed problems, The discretized discrepancy principle under general source conditions, A posteriori parameter choice with an efficient discretization scheme for solving ill-posed problems, Convolution regularization method for backward problems of linear parabolic equations, Nonstationary iterated Tikhonov regularization, Modern regularization methods for inverse problems, Stability estimates and regularization for an inverse heat conduction prolem in semi - infinite and finite time intervals, \textit{A posteriori} regularization method for the two-dimensional inverse heat conduction problem, Parameter Choices for Fast Harmonic Spline Approximation, The use of Morozov's discrepancy principle for Tikhonov regularization for solving nonlinear ill-posed problems, On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems, Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems, Regularization of exponentially ill-posed problems, A modified landweber method for inverse problems, A parameter choice for Tikhonov regularization for solving nonlinear inverse problems leading to optimal convergence rates
Cites Work
- Discrepancy principles for Tikhonov regularization of ill-posed problems leading to optimal convergence rates
- On the choice of the regularization parameter for iterated Tikhonov regularization of ill-posed problems
- An A Posteriori Parameter Choice for Ordinary and Iterated Tikhonov Regularization of Ill-Posed Problems Leading to Optimal Convergence Rates
- On rates of convergence for approximations to the generalized inverse
- Necessary and sufficient conditions for convergence of regularization methods for solving linear operator equations of the first kind
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
