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.64e −13 | 2.31e −14 | 2.07e −12 | 6.0768 | 844 |
n/8 | 0.01n | 1 | 3.28e −13 | 4.93e −14 | 3.70e −12 | 5.1040 | 1305 |
n/4 | 0.02n | 3 | 1.32e −13 | 3.13e −14 | 9.93e −11 | 5.7287 | 799 |
n/8 | 0.01n | 3 | 3.93e −13 | 1.06e −13 | 2.61e −10 | 4.9531 | 1255 |
n/4 | 0.02n | 5 | 1.08e −13 | 2.55e −14 | 5.76e −09 | 5.3643 | 752 |
n/8 | 0.01n | 5 | 4.01e −13 | 1.25e −13 | 2.10e −08 | 4.5700 | 1157 |