What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?

DOI10.1109/TIT.2021.3067280zbMath1473.94016arXiv1910.05652OpenAlexW3138474759MaRDI QIDQ5001600

Mustafa Devrim Kaba, Enrique Mallada, Mengnan Zhao, Daniel P. Robinson, René Victor Valqui Vidal

Publication date: 22 July 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

sparse recovery problemsmaximum abstract simplicial complex

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

This page was built for publication: What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?