A. Dixit, D.R. Sahu, P. Gautam, T. Som, J.C. Yao, An accelerated forward-backward splitting algorithm for solving inclusion problems with applications to regression and link prediction problems

Full Text: PDF
DOI: 10.23952/jnva.5.2021.1.06

Volume 5, Issue 1, 1 February 2021, Pages 79-101

Abstract. The forward-backward method is a very popular approach to solve composite inclusion problems. In this paper, we propose a novel accelerated forward-backward algorithm to obtain the vanishing point of sum of two operators in which one is maximal monotone and other is $M$ -cocoercive, where $M$ is a linear bounded operator on underlying spaces. Our proposed algorithm is more general than previously known algorithms. We study the convergence behavior of proposed algorithm under mild assumptions in the framework of real Hilbert spaces. We employ our model to solve regression problems and link prediction problems for high dimensional datasets and conduct numerical experiments to support our results. This model improves convergence speed and accuracy in respective problems. We also conduct numerical experiments to support our results.

How to Cite this Article:
A. Dixit, D.R. Sahu, P. Gautam, T. Som, J.C. Yao, An accelerated forward-backward splitting algorithm for solving inclusion problems with applications to regression and link prediction problems, J. Nonlinear Var. Anal. 5 (2021), 79-101.