On the classical logarithmic barrier function method for a class of smooth convex programming problems