Andreas Themelis

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness

2025 · ArXiv.org

This paper introduces adaptive Bregman proximal gradient algorithms for solving convex composite minimization problems without relying on global relative smoothness or strong convexity assumptions. Building upon recent advances in adaptive stepsize selections, the proposed methods …