Projection algorithms for composite minimization
Projection algorithms for composite minimization
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms consist of two steps. Once the kth iterate is constructed, an inner circle of gradient …