Develops ℓ1 SDP relaxation plus randomized algorithm for sparse {0,±1} least squares, with 1/T² approximation when σ ≪ T and exact recovery under sub-Gaussian or coherence conditions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An SDP Relaxation for the Sparse Integer Least Squares Problem
Develops ℓ1 SDP relaxation plus randomized algorithm for sparse {0,±1} least squares, with 1/T² approximation when σ ≪ T and exact recovery under sub-Gaussian or coherence conditions.