Inverse problems with sparsity constraints: Convergence rates and exact recovery
From MaRDI portal
Publication:3086121
zbMATH Open1213.65084MaRDI QIDQ3086121FDOQ3086121
Publication date: 29 March 2011
Tikhonov regularizationstabilityinverse problemssparsity constraintssource conditionill-posed inverse problemthesis
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)
Cited In (9)
- An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
- TV-min and greedy pursuit for constrained joint sparsity and application to inverse scattering
- Sparsity of solutions for variational inverse problems with finite-dimensional data
- COLLAGE-BASED INVERSE PROBLEMS FOR IFSM WITH ENTROPY MAXIMIZATION AND SPARSITY CONSTRAINTS
- Tradeoffs Between Convergence Speed and Reconstruction Accuracy in Inverse Problems
- Domain decomposition methods for linear inverse problems with sparsity constraints
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- Linear reconstruction problems with convex constraints: Influence of the a priori data
Recommendations
- On the role of sparsity in inverse problems π π
- Sparse recovery in inverse problems π π
- Exact support recovery for linear inverse problems with sparsity constraints π π
- Beyond convergence rates: exact recovery with the Tikhonov regularization with sparsity constraints π π
- Convergence rates for regularization with sparsity constraints π π
This page was built for publication: Inverse problems with sparsity constraints: Convergence rates and exact recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086121)