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

Publication date: 15 January 2021

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: Theoretical and numerical comparison of first-order algorithms for cocoercive equations and smooth convex optimization