Complexity of linear ill-posed problems in Hilbert space
DOI10.1016/J.JCO.2016.10.003zbMATH Open1354.65106OpenAlexW2535845662MaRDI QIDQ346297FDOQ346297
Authors: Peter Mathé, Sergei V. Pereverzyev
Publication date: 5 December 2016
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2016.10.003
Recommendations
Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22) Linear operators and ill-posed problems, regularization (47A52) Numerical solutions to equations with linear operators (65J10)
Cites Work
- Title not available (Why is that?)
- Regularization of some linear ill-posed problems with discretized random noisy data
- A mathematical introduction to compressive sensing
- Regularization theory for ill-posed problems. Selected topics
- Geometry of linear ill-posed problems in variable Hilbert scales
- How general are general source conditions?
- Optimal filtering of square-integrable signals in Gaussian noise
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Estimation of Linear Operators in Hilbert Spaces from Inaccurate Data
- Statistical Inverse Estimation in Hilbert Scales
- An information-based approach to ill-posed problems
- Optimal discretization of inverse problems in Hilbert scales. Regularization and self-regulari\-za\-tion of projection methods
- On a characteristic property of conditionally well-posed problems
- Title not available (Why is that?)
- Modulus of continuity for conditionally stable ill-posed problems in Hilbert space
- Regularizability of ill-posed problems and the modulus of continuity
- What is the complexity of ill-posed problems?
- Title not available (Why is that?)
- Variable hilbert scales and their interpolation inequalities with applications to tikhonov regularization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- What do we learn from the discrepancy principle?
Cited In (13)
- Optimal Convergence of the Discrepancy Principle for Polynomially and Exponentially Ill-Posed Operators under White Noise
- Tractability of linear ill-posed problems in Hilbert space
- Weak-norm posterior contraction rate of the 4DVAR method for linear severely ill-posed problems
- Randomized matrix approximation to enhance regularized projection schemes in inverse problems
- Noise Level Free Regularization of General Linear Inverse Problems under Unconstrained White Noise
- Noise models for ill-posed problems
- What is the complexity of ill-posed problems?
- A probabilistic oracle inequality and quantification of uncertainty of a modified discrepancy principle for statistical inverse problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal indirect estimation for linear inverse problems with discretely sampled functional data
- Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
- Hyperbolic cross and the complexity of various classes of ill-posed linear problems
This page was built for publication: Complexity of linear ill-posed problems in Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346297)