A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems

The Douglas–Rachford splitting method is a classical and powerful method for minimizing the sum of two convex functions. In this paper, we introduce two dynamical systems based on this method for s...