LAUSR

Monotone inclusion problems are crucial to solve engineering problems and problems arising in different branches of science. In this paper, we propose a novel two-step inertial Douglas-Rachford algorithm to solve the monotone inclusion problem of the sum of two maximally monotone operators based on the normal S-iteration method (Sahu, D.R.: Applications of the S-iteration process to constrained minimization problems and split feasibility problems. Fixed Point Theory 12(1), 187–204 (2011)). We have studied the convergence behavior of the proposed algorithm. Based on the proposed method, we develop an inertial primal-dual algorithm to solve highly structured monotone inclusions containing the mixtures of linearly composed and parallel-sum type operators. Finally, we apply the proposed inertial primal-dual algorithm to solve a highly structured minimization problem. We also perform a numerical experiment to solve the generalized Heron problem and compare the performance of the proposed inertial primal-dual algorithm to already known algorithms.