A tilted cutting plane proximal bundle method for convex nondifferentiable optimization

A proximal bundle method is given for minimizing a convex function @?. It accumulates so-called tilted cutting planes in polyhedral approximations to @? that introduce some second-order information and interior point features absent in usual methods. Global convergence of the method is proved.