Algorithm 1(b).
Input: Projections X′, α and β, error bound ε, maximum iteration number mmax, SEPP(0) → ∞ | |
Output: SEPP(m+1) and fx(m+1) | |
1: | for m = 0 to mmax do |
2: | fx(m+1) = fx(m) − τ · Δ(m) |
3: | SEPP(m+1) = SEPP (α, β, fx(m+1)) |
4: | if |SEPP(m+1) − SEPP(m)| ≤ ε then |
5: | break |
6: | end if |
7: | end for |