A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
Review articleOpen access

AbstractA 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.

Request full text

References (0)

Cited By (0)

No reference data.
No citation data.
Join Copernicus Academic and get access to over 12 million papers authored by 7+ million academics.
Join for free!