Solving Coupled Composite Monotone Inclusions by Successive Fej\'er Approximations of Their Kuhn-Tucker Set

We propose a new class of primal-dual Fejer monotone algorithms for solving systems of com- posite monotone inclusions. Our construction is inspired by a framework used by Eckstein and Svaiter for the basic problem of finding a zero of the sum of two monotone operators. At each iteration, points in the graph of the monotone operators present in the model are used to con- struct a half-space containing the Kuhn-Tucker set associated with the system. The primal-dual update is then obtained via a relaxed projection of the current iterate onto this half-space. An important feature that distinguishes the resulting splitting algorithms from existing ones is that they do not require prior knowledge of bounds on the linear operators involved or the inversion of linear operators.