Scaling law for recovering the sparsest element in a subspace

DOI10.1093/imaiai/iau007OpenAlexW2964243449MaRDI QIDQ4603698

Paul E. Hand, Laurent Demanet

Publication date: 19 February 2018

Published in: Information and Inference (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingsignal recoverysparsitydictionary learningsparse principle component analysis

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (3)

Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation ⋮ Discrete uncertainty principles and sparse signal processing ⋮ Finding a low-rank basis in a matrix subspace

This page was built for publication: Scaling law for recovering the sparsest element in a subspace