Akiko Takeda

Accelerated Bregman Proximal Gradient Methods from Dual Geometric Perspectives

We study Bregman proximal gradient (BPG) algorithms under relative smoothness for convex, relatively strongly convex, and nonconvex objectives. Existing accelerated BPG algorithms for convex objectives typically require additional assumptions on Bregman divergences, most notably triangle-scaling conditions, which can l...