A minimization method is described for convex subdifferentiable functions and the convergence proof is given. The method is based on an extension of the subdifferential in such a way that this point to set map is continuous. Different methods follow for a special choice of the used norm and the used extension of the subdifferential. For certain classes of functions the method is explained in detail and corresponding realisations of the extensions of the subdiffential are given.