A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization: The IFB Iterates Minimize the Objective and Converge Weakly to a MinimizerResearch Paper
Many problems in signal processing, statistics and operations research ask to minimize a sum of a nonsmooth convex term (a constraint indicator, an penalty) and a smooth term . The standard method is the forward-backward (proximal-gradient) algorithm: an explicit gradient step on followed by a proximal step on .…