This paper provides a theoretical and numerical comparison of classical first-order splitting methods for solving smooth convex optimization problems cocoercive equations. From point view, we compare convergence rates gradient descent, forward-backward, Peaceman-Rachford, Douglas-Rachford algorithms minimizing the sum two functions when one them is strongly convex. A similar given in more gener...