Table 1 SBR algorithm [30]

1. Initialize. Set the index set Ω₁ = ∅, The coefficient vector x₁ = [0,..., 0]^Tand set the counter to k = 1.

2. Identify. Find the replacement n_k of Φ that most decreases the objective function:$n_k\in \underset{n}{\text{arg min}}\text{{}{\mathcal{J}}_{{\Omega }_k•n}\left(\lambda \right):={ℰ}_{\Omega •n}+\lambda \text{Card(}\Omega •n\text{)}}$

3. Iterate. Update the active set if ${\mathcal{J}}_{{\Omega }_k•n_k}\left(\lambda \right)<{\mathcal{J}}_{{\Omega }_k}\left(\lambda \right)$${\Omega }_{k+1}={\Omega }_k•n_k.$

Increment k. Repeat (2)-(3) until the active set is not updated.

4. Output. Return x = x _k , the active amplitudes.