1 paper
Yuya Yamashita, Shota Takahashi, Akiko Takeda
We study Bregman proximal gradient (BPG) algorithms under relative smoothness for convex, relatively strongly convex, and nonconvex objectives. Existing accelerated BPG algorithms…