Conditions on optimal support recovery in unmixing problems by means of multi-penalty regularization

DOI10.1088/0266-5611/32/10/104007zbMath1358.94010arXiv1601.01461OpenAlexW3098718652MaRDI QIDQ2832554

Markus Grasmair, Valeriya Naumova

Publication date: 11 November 2016

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

Full work available at URL: https://arxiv.org/abs/1601.01461

zbMATH Keywords

sparsitysupport recoverycompressed sensingmulti penalty regularizationunmixing problems

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (5)

Coupled regularization with multiple data discrepancies ⋮ Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements ⋮ Adaptive multi-penalty regularization based on a generalized Lasso path ⋮ Robust sensing of low-rank matrices with non-orthogonal sparse decomposition ⋮ Computational approaches to non-convex, sparsity-inducing multi-penalty regularization

This page was built for publication: Conditions on optimal support recovery in unmixing problems by means of multi-penalty regularization