  We propose and study the iteration-complexity of an inexact version of the
Spingarn's partial inverse method. Its complexity analysis is performed by
viewing it in the framework of the hybrid proximal extragradient (HPE) method,
for which pointwise and ergodic iteration-complexity has been established
recently by Monteiro and Svaiter. As applications, we propose and analyze the
iteration-complexity of an inexact operator splitting algorithm -- which
generalizes the original Spingarn's splitting method -- and of a parallel
forward-backward algorithm for multi-term composite convex optimization.
