A New Inertial Self-adaptive Gradient Algorithm for the Split Feasibility Problem and an Application to the Sparse Recovery Problem

Abstract

In this paper, by combining the inertial technique and the gradient descent method with Polyak’s stepsizes, we propose a novel inertial self-adaptive gradient algorithm to solve the split feasibility problem in Hilbert spaces and prove some strong and weak convergence theorems of our method under standard assumptions. We examine the performance of our method on the sparse recovery problem beside an example in an infinite dimensional Hilbert space with synthetic data and give some numerical results to show the potential applicability of the proposed method and comparisons with related methods emphasize it further. © 2023, Springer-Verlag GmbH Germany & The Editorial Office of AMS.