Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
From MaRDI portal
Publication:3547717
DOI10.1109/TIT.2005.844057zbMath1288.94020WikidataQ59750814 ScholiaQ59750814MaRDI QIDQ3547717
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
Computing and analyzing recoverable supports for sparse reconstruction, Minimizers of sparsity regularized Huber loss function, Cosparsity in Compressed Sensing, Feature selection when there are many influential features, Strengthening hash families and compressive sensing, Remote sensing via \(\ell_1\)-minimization, A hierarchical framework for recovery in compressive sensing, Sampling rates for \(\ell^1\)-synthesis, Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games, Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications, On the conditioning of random subdictionaries, Sparse signal recovery using a new class of random matrices, The null space property for sparse recovery from multiple measurement vectors, Sparsity in time-frequency representations, Necessary and sufficient conditions of solution uniqueness in 1-norm minimization, Sparse recovery by non-convex optimization - instance optimality, Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines, Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation
