Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions

Abstract

The generalized conditional gradient method is a popular algorithm for solving composite problems whose objective function is the sum of a smooth function and a nonsmooth convex function. Many convergence analyses of the algorithm rely on smoothness assumptions, such as the Lipschitz continuity of the gradient of the smooth part. This paper provides convergence results of linesearch-based generalized conditional gradient methods without smoothness assumptions. In particular, we show that a parameter-free variant, which automatically adapts to the Hölder exponent, guarantees convergence even when the gradient of the smooth part of the objective is not Hölder continuous.

arXiv admin note: text overlap with arXiv:2505.00381