Given a Hilbert space
, a closed convex subset
and a countable family of functions
), the authors consider the problem of finding
, as well as the problem of finding the projection of
, the solution set of the preceding problem. In order to accomplish these aims, proximal-like block-iterative algorithms, as well as regularization and splitting algorithms, are proposed. For every algorithm, convergence results are established.