1 citations · 1 across the 3 of their papers we have counts for
1 paper · 2 filters
Fredrik Andersson, Marcus Carlsson, Carl Olsson
We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-c…