A Theoretical Analysis of Sparse Recovery Stability of Dantzig Selector and LASSO (2017)
Attributed to:
Foundation and Reweighted Algorithms for Sparsest Points of Convex Sets with Application to Data Processing
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1711.03783
Publication URI: https://arxiv.org/abs/1711.03783
Type: Journal Article/Review
Parent Publication: arXiv e-prints