“…where c p,k := τ (ρ η p,k + δ p,k ) is a model correction term inspired from the RESESOP method studied in the previous section. The connection to RESESOP-Kaczmarz is revealed by the following observation: If we assume that one of the summands in ‡ https://github.com/jleuschn/dival/tree/master/dival/reconstructors/networks (26) is zero, then it is not difficult to see that ϕ θ (z) belongs to the boundary of the restricted stripe B ρ (0) ∩ H(u η,δ,j p,k , α η,δ,j p,k , ξ η,δ,j p,k ), where u η,δ,j p,k := (A η,j p,k ) * (A η,j p,k ϕ θ (z) − g δ p,k ), α p,k := A η,j p,k ϕ θ (z) − g δ p,k , g δ p,k , ξ η,δ,j p,k := c p,k A η,j p,k ϕ θ (z) − g δ p,k are analogously defined as in Algorithm 3.3. Hence, if θ opt is a minimizer of 2 , then ϕ θopt (z) is expected to be close to the boundary of all those stripes.…”