In this paper we describe a number of new variants of bundle methods for nonsmooth unconstrained and constrained convex optimization, convex—concave games and variational inequalities. We outline the ideas underlying these methods and present rate-of-convergence estimates.
Lemaréchal, C., Nemirovski, A., & Nesterov, Y. (1995). New variants of bundle methods. Mathematical Programming, 69(1-3), 111-147. https://hdl.handle.net/2078.5/46100 (Original work published 1995)