Rate of Convergence of the Bundle Method
Abstract
We prove that the bundle method for nonsmooth optimization achieves solution accuracy in at most O((1/)/) iterations, if the function is strongly convex. The result is true for the versions of the method with multiple cuts and with cut aggregation.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.