## An inexact proximal bundle method with applications to convex conic programming

We present an inexact bundle method for minimizing an unconstrained convex sup-function with an open domain. Under some mild assumptions, we reformulate a convex conic programming problem as such problem in terms of the support function. This method is a ﬁrst-order method, hence it requires much less computational cost in each iteration than second-order approaches … Read more