A Bregman inertial forward-reflected-backward method for nonconvex minimization
Abstract
We propose a Bregman inertial forward-reflected-backward (BiFRB) method for nonconvex composite problems. Our analysis relies on a novel approach that imposes general conditions on implicit merit function parameters, which yields a stepsize condition that is independent of inertial parameters. In turn, a question of Malitsky and Tam regarding whether FRB can be equipped with a Nesterov-type acceleration is resolved. Assuming the generalized concave Kurdyka-ojasiewicz property of a quadratic regularization of the objective, we obtain sequential convergence of BiFRB, as well as convergence rates on both the function value and actual sequence. We also present formulae for the Bregman subproblem, supplementing not only BiFRB but also the work of Bot-Csetnek-L\'aszl\'o and Bot-Csetnek. Numerical simulations are conducted to evaluate the performance of our proposed algorithm.
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.