From the abstract: In this paper, we demonstrate that the use of a parametrized penalty function in nonsmooth convex optimization can be avoided without using the relatively complex filter methods. We propose an approach which appears to be more direct and easier to implement, in the sense that it is closer in the spirit and structure to the well-developed unconstrained bundle methods. Preliminary computational results are also reported.