From: A fast and accurate algorithm for ℓ 1 minimization problems in compressive sampling
m | s | θ | ℓ 2-error | ℓ 1-error | ℓ ∞ -error | CPU time(s) | Iterations |
---|---|---|---|---|---|---|---|
n/4 | 0.02n | 1 | 1.01e −3 | 4.08e −4 | 8.99e −3 | 2.3762 | 315 |
n/8 | 0.01n | 1 | 1.65e −3 | 5.13e −4 | 1.29e −2 | 1.8412 | 455 |
n/4 | 0.02n | 3 | 3.57e −4 | 1.68e −4 | 0.1729 | 1.2184 | 160 |
n/8 | 0.01n | 3 | 6.10e −4 | 2.46e −4 | 0.2602 | 0.8990 | 211 |
n/4 | 0.02n | 5 | 4.51e −05 | 5.52e −05 | 2.1526 | 1.0484 | 139 |
n/8 | 0.01n | 5 | 6.22e −05 | 4.56e −05 | 3.1652 | 0.7387 | 165 |