We give efficiency estimates for proximal bundle methods for finding f*minXf, where f and X are convex. We show that, for any accuracy <0, these methods find a point xkX such that f(xk)–f* after at most k=O(1/3) objective and subgradient evaluations.