|
| |
| Algorithm 1 conv-SPP | |
|
| |
| 1: | Set W = 1; |
| 2: | Solve Equation (6); |
| 3: | Update W as in Equation (7) and ϵ as in Equation (8); |
| 4: | Go back to step 2, if none of the stopping criteria is true; |
| 5: | Discard zero elements of C; |
| 6: | Solve Equation (5) with updated C; |
|
| |
|
| |
| Algorithm 1 conv-SPP | |
|
| |
| 1: | Set W = 1; |
| 2: | Solve Equation (6); |
| 3: | Update W as in Equation (7) and ϵ as in Equation (8); |
| 4: | Go back to step 2, if none of the stopping criteria is true; |
| 5: | Discard zero elements of C; |
| 6: | Solve Equation (5) with updated C; |
|
| |