Rate of Convergence of the Bundle Method

We prove that the bundle method for nonsmooth optimization achieves solution accuracy $\epsilon$ in at most $\mathcal{O}(\ln (1\mathrm{/}\epsilon )\mathrm{/}\epsilon )$ iterations, if the function is strongly convex. The result is true for the versions of the method with multiple cuts and with cut aggregation.