A relaxed version of Bregman's method for convex programming