A hybrid proximal generalized conditional gradient method and application to total variation parameter learning
Abstract
In this paper we present a new method for solving optimization problems involving the sum of two proper, convex, lower semicontinuous functions, one of which has Lipschitz continuous gradient. The proposed method has a hybrid nature that combines the usual forward-backward and the generalized conditional gradient method. We establish a convergence rate of o(k-1/3) under mild assumptions with a specific step-size rule and show an application to a total variation parameter learning problem, which demonstrates its benefits in the context of nonsmooth convex optimization.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.