A stochastic convergence analysis for Tikhonov regularization with sparsity constraints

DOI10.1088/0266-5611/30/5/055009zbMath1317.47014OpenAlexW2065534109MaRDI QIDQ4979745

Daniel Gerth, Ronny Ramlau

Publication date: 19 June 2014

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0266-5611/30/5/055009

zbMATH Keywords

MAPconvergence analysisTikhonov regularizationsparsity constraintsKy Fan metricstochastic settingBesov penalties

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items (5)

On the lifting of deterministic convergence rates for inverse problems with stochastic noise ⋮ Are Minimizers of the Onsager–Machlup Functional Strong Posterior Modes? ⋮ Convex blind image deconvolution with inverse filtering ⋮ Sparsity-promoting and edge-preserving maximum a posteriori estimators in non-parametric Bayesian inverse problems ⋮ Sparse inverse covariance matrix estimation via the $ \newcommand{\e}{{\rm e}} \ell_{0}$ -norm with Tikhonov regularization

This page was built for publication: A stochastic convergence analysis for Tikhonov regularization with sparsity constraints