In this paper, we introduce a shrinking projection method of an inertial type with self-adaptive step size for finding a common element of the set of solutions of a split generalized equilibrium problem and the set of common fixed points of a countable family of nonexpansive multivalued mappings in real Hilbert spaces. The self-adaptive step size incorporated helps to overcome the difficulty of having to compute the operator norm, while the inertial term accelerates the rate of convergence of the proposed algorithm. Under standard and mild conditions, we prove a strong convergence theorem for the problems under consideration and obtain some consequent results. Finally, we apply our result to solve split mixed variational inequality and split minimization problems, and we present numerical examples to illustrate the efficiency of our algorithm in comparison with other existing algorithms. Our results complement and generalize several other results in this direction in the current literature.

In this paper, we present a new modified self-adaptive inertial sub-gradient extragradient algorithm in which the two projections are made onto some half spaces. Moreover, under mild conditions, we obtain a strong convergence of the sequence generated by our proposed algorithm for approximating a common solution of variational inequality problem and common fixed point of a finite family of demicontractive mappings in a real Hilbert space. The main advantages of our algorithm are: strong convergence result obtained without prior knowledge of the Lipschitz constant of the related monotone operator, the two projections made onto some half-spaces and the inertial technique which speeds up rate of convergence. Finally, we present an application and a numerical example to illustrate the usefulness and applicability of our algorithm.

In this article, we study a class of pseudomonotone split variational inequality problems (VIPs) with non-Lipschitz operator. We propose a new inertial extragradient method with self-adaptive step sizes for finding the solution to the aforementioned problem in the framework of Hilbert spaces. Moreover, we prove a strong convergence result for the proposed algorithm without prior knowledge of the operator norm and under mild conditions on the control parameters. The main advantages of our algorithm are: the strong convergence result obtained without prior knowledge of the operator norm and without the Lipschitz continuity condition often assumed by authors; the minimized number of projections per iteration compared to related results in the literature; the inertial technique employed, which speeds up the rate of convergence; and unlike several of the existing results in the literature on VIPs with non-Lipschitz operators, our method does not require any linesearch technique for its implementation. Finally, we present several numerical examples to illustrate the usefulness and applicability of our algorithm.