In this paper we investigate a family of second order differential equations which can be considered as the continuous versions of the Fletcher-Reeves iteration for minimization applied to a regularized and penalized convex programming problem. We show that synchronizing the parameter functions of the differential equation the stationary limit point of the trajectories is the minimal norm solution of the given convex programming problem. © 2012 Miskolc University Press.