<p>In this article, we study inertial algorithms for numerically solving monotone inclusions involving the sum of a maximally monotone and a cocoercive operator. In particular, we analyze the convergence of inertial and relaxed versions of the nonlinear forward–backward with momentum (NFBM). We propose an inertial version of NFBM including a relaxation step and a second version considering a double-inertial step with additional momentum. By applying NFBM to specific monotone inclusions, we derive inertial and relaxed versions of algorithms such as forward–backward, forward-half-reflected-backward (FHRB), Chambolle–Pock, Condat–Vũ, among others, thereby recovering and extending previous results from the literature for solving monotone inclusions involving maximally monotone, cocoercive, monotone and Lipschitz, and linear bounded operators. We also present numerical experiments on image restoration, comparing the proposed inertial and relaxed algorithms. In particular, we compare the inertial and relaxed FHRB with its non-inertial and momentum versions. Additionally, we compare the numerical convergence for larger step-sizes versus relaxation parameters and introduce a <i>restart</i> strategy that incorporates larger step-sizes and inertial steps to further enhance numerical convergence.</p>