Theoretical and numerical comparison of first order algorithms for cocoercive equations and smooth convex optimization

This paper provides a theoretical and numerical comparison of classical first-order splitting methods for solving smooth convex optimization problems and cocoercive equations. From a theoretical point of view, we compare convergence rates of gradient desc