Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
DOI10.3846/13926292.2017.1307284zbMATH Open1488.65769OpenAlexW2615123869MaRDI QIDQ5015454FDOQ5015454
Authors: S. G. Solodky, Ganna L. Myleiko, E. V. Semenova 
Publication date: 8 December 2021
Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3846/13926292.2017.1307284
Recommendations
- On the a posteriori choice of a regularization parameter in the solution of severely ill-posed problems
- About regularization of severely ill-posed problems by standard Tikhonov's method with the balancing principle
- Regularization of ill-posed problems: Optimal parameter choice in finite dimensions
- scientific article; zbMATH DE number 2208583
- Optimal a Posteriori Parameter Choice for Tikhonov Regularization for Solving Nonlinear Ill-Posed Problems
Fredholm integral equations (45B05) Numerical methods for ill-posed problems for integral equations (65R30) Linear operators and ill-posed problems, regularization (47A52)
Cites Work
- Title not available (Why is that?)
- Regularization theory for ill-posed problems. Selected topics
- Morozov's discrepancy principle for tikhonov
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tikhonov Regularization for Finitely and Infinitely Smoothing Operators
- Title not available (Why is that?)
- Optimality for ill-posed problems under general source conditions
- On a Problem of Adaptive Estimation in Gaussian White Noise
- Complexity of linear ill-posed problems in Hilbert space
- Regularization of exponentially ill-posed problems
- On the Adaptive Selection of the Parameter in Regularization of Ill-Posed Problems
- The approximate solution of operator equations of the first kind
- On the regularization of projection methods for solving ill-posed problems
- Optimization of projection methods for solving ill-posed problems
- A Lepskij-type stopping rule for regularized Newton methods
- About the balancing principle for choice of the regularization parameter
- Title not available (Why is that?)
- The minimal radius of Galerkin information for severely ill-posed problems
- Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- Information complexity of equations of the second kind with compact operators in Hilbert space
- Complexity of the problem of finding the solutions of fredholm equations of the second kind with smooth kernels. I
- Complexity of the problem of finding the solutions of Fredholm equations of the second kind with smooth kernels. II
- About regularization of severely ill-posed problems by standard Tikhonov's method with the balancing principle
- The minimal radius of Galerkin information for the Fredholm problem of the first kind
- On optimization of projection methods for solving some classes of severely ill-posed problems
- On the optimal order of accuracy of an approximate solution to the Symm's integral equation
- Optimization of projection methods for linear ill-posed problems
- Complexity for some classes of well-posed problems
Cited In (4)
- About regularization of severely ill-posed problems by standard Tikhonov's method with the balancing principle
- Title not available (Why is that?)
- On the a posteriori choice of a regularization parameter in the solution of severely ill-posed problems
- Information complexity-based regularization parameter selection for solution of ill conditioned inverse problems
This page was built for publication: Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015454)
