Proximal Decomposition on the Graph of a Maximal Monotone Operator

We present an algorithm to solve: Find $( x,y ) \in A \times A^ \bot $ such that $y \in Tx$, where A is a subspace and T is a maximal monotone operator. The algorithm is based on the proximal decomposition on the graph of a monotone operator and we show how to recover Spingarn’s decomposition method... View More