Search

In this work, we establish the closedness and convexity of the set of fixed points of equally continuous and asymptotically demicontractive mapping in the intermediate sense. We proposed an inertial hybrid projection technique for determining an approximate common solution to three significant problems. The first is the system of generalized mixed equilibrium problems with relaxed η−ζ$$ \eta -\zeta $$ monotone mappings, the second is the problem of fixed points of a countable family of equally continuous and asymptotically demicontractive mappings in the intermediate sense, and the third is of determining a point in a null space of a countable family of inverse strongly monotone mappings in Hilbert space. Based on these problems, we formulate a theorem and establish its strong convergence to their common solution. Additionally, we studied the applications of our algorithm to variational inequality problems and convex optimization problems. Finally, we numerically demonstrate the efficiency and robustness of our scheme. Several results available in the literature can be obtained as special cases of our result. [ABSTRACT FROM AUTHOR]

In this paper, we propose a modified general inertial Mann algorithm and prove that it generates a sequence which converges weakly to a fixed point of a nonexpansive mapping in Hilbert spaces. Moreover, by using the viscosity method, we introduce a general inertial viscosity algorithm and prove that it generates a sequence which converges strongly to a common fixed point of a countable family of nonexpansive operators. We also derive schemes for solving constrained convex optimization, monotone inclusion, and nonsmooth convex optimization problems. Finally, we apply one of our proposed algorithms to solve image restoration problem. [ABSTRACT FROM AUTHOR]

The purpose of the present paper is to construct a common solution of the split null point problem associated with the maximal monotone operators and the fixed point problem associated with a finite family of k‐demicontractive operators in Hilbert spaces. We compute the optimal common solution via inertial parallel hybrid algorithm under a suitable set of control conditions. The viability of parallel implementation of the algorithm is demonstrated for various theoretical as well as numerical results. The results presented in this paper improve various existing results in the current literature. [ABSTRACT FROM AUTHOR]

In this paper, we study the split common fixed point problem in Hilbert spaces. We find a common solution of the split common fixed point problem for two demicontractive operators without a priori knowledge of operator norms. A strong convergence theorem is obtained under some additional conditions and numerical examples are included to illustrate the applications in signal compressed sensing and image restoration.

In this paper, we introduce an inertial accelerated outer quadratic approximation method for solving the split feasibility problem in Hilbert spaces. The algorithm uses projections onto closed balls approximations of the original split feasibility problem involved sets. Since the projection onto the closed ball has a closed form, the proposed method is thus convenient to implement. Moreover, it uses a self-adaptive step-size which does not need any prior information of the operator norm. Under some suitable assumptions, we establish and prove a strong convergence theorem for the proposed algorithm. Finally, we provide several numerical experiments to demonstrate the performances of our proposed method. We also give the applications of our result to elastic nets. Our method generalizes and improves many results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we prove strong convergence theorem of the general inertial Mann–Halpern algorithm for nonexpansive mappings in the setting of Hilbert spaces. We also prove weak convergence theorem of the general inertial Mann algorithm for k-strict pseudo-contractive mappings in the setting of Hilbert spaces. These convergence results extend and generalize some existing results in the literature. Finally, we provide examples to verify our main results. [ABSTRACT FROM AUTHOR]

In this article, we introduce the fundamentals of the theory of demicontractive mappings in metric spaces and expose the key concepts and tools for building a constructive approach to approximating the fixed points of demicontractive mappings in this setting. By using an appropriate geodesic averaged perturbation technique, we obtained strong convergence and Δ-convergence theorems for a Krasnoselskij-Mann type iterative algorithm to approximate the fixed points of quasinonexpansive mappings within the framework of CAT(0) spaces. The main results obtained in this nonlinear setting are natural extensions of the classical results from linear settings (Hilbert and Banach spaces) for both quasi-nonexpansive mappings and demicontractive mappings. We applied our results to solving an equilibrium problem in CAT(0) spaces and showed how we can approximate the equilibrium points by using our fixed point results. In this context we also provided a numerical example in the case of a demicontractive mapping that is not a quasi-nonexpansive mapping and highlighted the convergence pattern of the algorithm in Table 1. It is important to note that the numerical example is set in non-Hilbert CAT(0) spaces. [ABSTRACT FROM AUTHOR]

In this paper, we consider the multiple-sets split feasibility problem in real Hilbert space and propose a self-adaptive method that uses projections onto quadratic (balls) approximations of the problem's associated sets. Our algorithm has several major advantages over existing methods in the literature. The first is its simple implementation as it uses closed-formula projection onto balls, and the second is that strong convergence is obtained under mild conditions. Several numerical experiments illustrate and compare the performances of the proposed scheme. [ABSTRACT FROM AUTHOR]

In this paper, we examine the convergence analysis of a variant of Tseng's splitting method for monotone inclusion problem and fixed point problem associated with an infinite family of η- demimetric mappings in Hilbert spaces. The qualitative results of the proposed variant shows strong convergence characteristics under a suitable set of control conditions. We also provide a numerical example to demonstrate the applicability of the variant with some applications. [ABSTRACT FROM AUTHOR]

In this article, an Ishikawa iteration scheme is modified for b$$ b $$‐enriched nonexpansive mapping to solve a fixed point problem and a split variational inclusion problem in real Hilbert spaces. Under some suitable conditions, we obtain convergence theorem. Moreover, to demonstrate the effectiveness and performance of proposed scheme, we apply the scheme to solve a split feasibility problem and compare it with some existing iterative schemes. [ABSTRACT FROM AUTHOR]

A family of inertial extragradient-type algorithms is proposed for solving convex pseudomonotone variational inequality with fixed-point problems, where the involved mapping for the fixed point is a ρ-demicontractive mapping. Under standard hypotheses, the generated iterative sequence achieves strong convergence to the common solution of the variational inequality and fixed-point problem. Some special cases and sufficient conditions that guarantee the validity of the hypotheses of the convergence statements are also discussed. Numerical applications in detail illustrate the theoretical results and comparison with existing methods. [ABSTRACT FROM AUTHOR]

In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization problem over the fixed point set of a finite family of multivalued demicontractive mappings. We also provide numerical results concerning the viability of the proposed algorithm with possible applications. [ABSTRACT FROM AUTHOR]

In this paper, we propose two new self-adaptive inertial relaxed C Q algorithms for solving the split feasibility problem with multiple output sets in the framework of real Hilbert spaces. The proposed algorithms involve computing projections onto half-spaces instead of onto the closed convex sets, and the advantage of the self-adaptive step size introduced in our algorithms is that it does not require the computation of operator norm. We establish and prove weak and strong convergence theorems for the iterative sequences generated by the introduced algorithms for solving the aforementioned problem. Moreover, we apply the new results to solve some other problems. Finally, we present some numerical examples to illustrate the implementation of our algorithms and compared them to some existing results. [ABSTRACT FROM AUTHOR]

In this paper, we construct three new extragradient-type iterative methods for solving variational inequalities in real Hilbert spaces. The proposed iterative methods are functionally equivalent to the extragradient method, which is used to solve variational inequalities in an infinite-dimensional real Hilbert space. The main advantage of these iterative methods is that they use a simple step size rule based on operator information instead of the Lipschitz constant or any line search method. Three strong convergence theorems are well proved, corresponding to the proposed methods by allowing certain control parameter conditions. Finally, we present some numerical experiments to verify the efficacy and superiority of the proposed iterative methods. [ABSTRACT FROM AUTHOR]

The multiple-sets split feasibility problem (MSSFP) requires finding a point closet to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space. Motivated by the ball-relaxed projection algorithm proposed by Yu et al. for the split feasibility problem (SFP), in this paper, we introduce ball-relaxed projection algorithms for solving the MSSFP. Instead of the level sets or half-spaces, our algorithms require computing the orthogonal projections onto closed balls. We establish weak and strong convergence of the proposed algorithms to a solution of the MSSFP. Finally, we provide preliminary numerical experiments to show the efficiency and the implementation of our method. [ABSTRACT FROM AUTHOR]

This study presents two inertial type extragradient algorithms for finding a common solution to the monotone variational inequalities and fixed point problems for ρ$$ \rho $$‐demicontractive mapping in real Hilbert spaces. We provide inertial type iterative algorithms with self‐adaptive variable step size rules that do not require prior knowledge of the operator value. Our algorithms employ a basic step size rule, which is derived by certain computations at each iteration. Without previous knowledge of the operators Lipschitz constant, two strong convergence theorems were obtained. Finally, we present a number of numerical experiments to evaluate the efficacy and applicability of the proposed algorithms. The conclusions of this study on variational inequality and fixed point problems support and extend previous findings. [ABSTRACT FROM AUTHOR]

In this article, we present an inertial subgradient extragradient-type method that uses a non-monotone step size rule to find a numerical solution to equilibrium problems in real Hilbert spaces. The presented iterative scheme is based on an extragradient subgradient method and an inertial-type scheme. In fact, the proposed iterative scheme is effective in terms of performance, and the key advantage derives directly from the use of the variable step size rule, which is revised by each iteration on the basis of the Lipschitz-type constants as well as certain prior iterations. We obtain a weak convergence theorem for a new method by using mild conditions on a bifunction. Applications of the main results are given to solve various nonlinear problems. Several numerical findings are given in order to illustrate the numerical behaviour of the proposed method and to compare it to others. [ABSTRACT FROM AUTHOR]

In this paper, we compute a common solution of the fixed point problem (FPP) and the generalized split common null point problem (GSCNPP) via the inertial hybrid shrinking approximants in Hilbert spaces. We show that the approximants can be easily adapted to various extensively analyzed theoretical problems in this framework. Finally, we furnish a numerical experiment to analyze the viability of the approximants in comparison with the results presented in (Reich and Tuyen in Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat. 114:180, 2020). [ABSTRACT FROM AUTHOR]

In this paper, we present new iterative techniques for approximating the solution of an equilibrium problem involving a pseudomonotone and a Lipschitz-type bifunction in Hilbert spaces. These techniques consist of two computing steps of a proximal-type mapping with an inertial term. Improved simplified stepsize rules that do not involve line search are investigated, allowing the method to be implemented more quickly without knowing the Lipschitz-type constants of a bifunction. The iterative sequences converge weakly on a specific solution to the problem when the control parameter conditions are properly specified. The numerical tests were carried out, and the results demonstrated the applicability and quick convergence of innovative approaches over earlier ones. [ABSTRACT FROM AUTHOR]

In this paper, we study a variant of Tseng's splitting method for monotone inclusion problem and fixed point problem associated with a finite family of 1-demimetric mappings in Hilbert spaces. The proposed algorithm is based on the combination of classical Tseng's method together with the viscosity Ces'aro means method and the Nesterov's acceleration method. The proposed iterative method exhibits accelerated strong convergence characteristics under suitable set of control conditions in such framework. Finally, we provide a numerical example to illustrate the applicability of the proposed algorithm as well as some useful abstract applications. [ABSTRACT FROM AUTHOR]

In this paper, we incorporate proximal point algorithm with some convex combination techniques to approximate a minimizer and a common fixed point of a family of multi-valued mappings in Hadamard spaces. We prove -convergence and strong convergence theorems for a convex lower semi-continuous function and multi-valued quasi-nonexpansive mappings. Furthermore, we apply our results to find mean, median and solve equilibrium problems in Hadamard spaces. Finally, we give two numerical examples, one in a non-Hilbert space with a non-convex functional and the other in a Hilbert space, to demonstrate the convergence of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we introduce two new self-adaptive iterative algorithms for finding the solution of a split variational inclusion problem in real Hilbert spaces. The strong convergence theorems are proved under suitable conditions. In applications, the main results are applied for solving the split feasibility problem, the split minimization problem, and the split common fixed point problem. In order to test the numerical performances, the proposed algorithms are compared with several existing algorithms in the literature. Finally, the computational experiments show that the proposed algorithms are fast and more efficient than other approaches. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a modification of the extragradient algorithm with a non-monotonic stepsize rule to solve equilibrium problems. This modification is based on the inertial subgradient technique. Under mild conditions, such as, the Lipschitz continuity and the monotonicity of a bifunction (including the pseudomonotonicity), the strong convergence of the proposed algorithm is established in a real Hilbert space. The proposed algorithm uses a non-monotonic stepsize rule based on the local bifunction information rather than its Lipschitz-type constants or other line search methods. We present various numerical examples, which illustrate the strong convergence of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we proposed two different methods for solving pseudomonotone and strongly pseudomonotone equilibrium problems. We can examine these methods as an extension and improvement of the Popov's extragradient method. We replaced the second minimization problem onto a closed convex set in the Popov's extragradient method, with a half-space minimization problem that is updated on each iteration and also formulates a useful method for determining the appropriate stepsize on each iteration. The weak convergence theorem of the first method and strong convergence theorem for the second method is well-established based on a standard assumption on a cost bifunction. We also consider various numerical examples to support our well-established convergence results, and we can see that the proposed methods depict a significant improvement in terms of the number of iterations and execution time. [ABSTRACT FROM AUTHOR]

In this article, we offer two modifications of the modified forward‐backward splitting method based on inertial Tseng method and viscosity method for inclusion problems in real Hilbert spaces. Under standard assumptions, such as Lipschitz continuity and monotonicity (also maximal monotonicity), we establish weak and strong convergence of the proposed algorithms. We give the numerical experiments to show the efficiency and advantage of the proposed methods and we also used our proposed algorithm for solving the image deblurring and image recovery problems. Our result extends some related works in the literature and the primary experiments might also suggest their potential applicability. [ABSTRACT FROM AUTHOR]

In this paper, we discuss about monotone vector fields, which is a typical extension to the theory of convex functions, by exploiting the tangent space structure. This new approach to monotonicity in CAT (0) spaces stands in opposed to the monotonicity defined earlier in CAT (0) spaces by Khatibzadeh and Ranjbar [J. Aust. Math. Soc. 103(1), 70–90 (2017).] and Chaipunya and Kumam [Optimization 66(10), 1647–1665 (2017).]. In particular, this new concept extends the theory from both Hilbert spaces and Hadamard manifolds, while the known concept barely has any obvious relationship to the theory in Hadamard manifolds. We also study the corresponding resolvents and Yosida approximations of a given monotone vector field and derive many of their important properties. Finally, we prove a generation theorem by showing convergence of an exponential formula applied to resolvents of a monotone vector field. Our findings improve several known results in the literature including generation theorems of Jost [AMS/IP Stud. Adv. Math., vol. 8, pp. 1–47. Amer. Math. Soc., Providence, RI (1998)], Mayer [Comm. Anal. Geom. 6(2), 199–253 (1998).], Stojkovic [Adv. Calc. Var. 5(1), 77–126 (2012).], and Bačák [Convex analysis and optimization in Hadamard spaces, De Gruyter Series in Nonlinear Analysis and Applications, vol. 22. De Gruyter, Berlin (2014).] for proper, convex, lower semicontinuous functions in the context of complete CAT (0) spaces, and also by Iwamiya and Okochi [Nonlinear Anal. 54(2), 205–214 (2003).] for monotone vector fields in the context of Hadamard manifolds. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new algorithm by incorporating an inertial term with a subgradient extragradient algorithm to solve the equilibrium problems involving a pseudomonotone and Lipschitz-type continuous bifunction in real Hilbert spaces. A weak convergence theorem is well established under certain mild conditions for the bifunction and the control parameters involved. Some of the applications to solve variational inequalities and fixed point problems are considered. Finally, several numerical experiments are performed to demonstrate the numerical efficacy and superiority of the proposed algorithm over other well-known existing algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we consider an improvement of the extragradient method to figure out the numerical solution for pseudomonotone equilibrium problems in arbitrary real Hilbert space. A new method is proposed with an inertial scheme and a self adaptive step size rule that is revised on each iteration based on the previous three iterations. The weak convergence of the method is proved by assuming standard cost bifunction assumptions. We also consider the application of our results to solve different kinds of variational inequality problems and a particular class of fixed point problems. For a numerical part, we study the well‐known Nash‐Cournot equilibrium model and other test problems to support our well‐established convergence results and to ensure that our proposed method has a competitive edge over CPU time and a number of iterations. [ABSTRACT FROM AUTHOR]

In this paper, we develop an iterative algorithm whose architecture comprises a modified version of the forward–backward splitting algorithm and the hybrid shrinking projection algorithm. We provide theoretical results concerning weak and strong convergence of the proposed algorithm towards a common solution of the fixed point problem associated to a finite family of demicontractive operators, the split equilibrium problem and the monotone inclusion problem in Hilbert spaces. Moreover, we compute a numerical experiment to show the efficiency of the proposed algorithm. As a consequence, our results improve various existing results in the current literature. [ABSTRACT FROM AUTHOR]

The objective of this study is to introduce two new extragradient methods to solve equilibrium problems involving two distinct classes of bifunction. Based on the pseudomonotonicity hypothesis and the specific Lipschitz-type cost bifunction condition, we have shown a weak convergence theorem for the first proposed method. The bifunction is strongly pseudomonotone in the second method, but the step-size rule does not depend on the strongly pseudomonotone constant and Lipschitz-type constants. In contrast, the first convergence result, we prove a strong convergence theorem with the use of a particular class of variable step-size rule sequences. To confirm the validity of the proposed convergence results, we examine two well-known Nash–Cournot equilibrium models for the numerical experiment and show that the competitive advantage of our proposed methods is based on time of execution and number of iterations. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new algorithm for solving a variational inequality problem in a Hilbert space. The algorithm originates from an explicit discretization of a dynamical system in time. We establish the convergence of the algorithm for a class of non-monotone and Lipschitz continuous operators, provided by the sequentially weak-to-weak continuity of cost operators. The rate of convergence of the algorithm is also proved under some standard hypotheses. Moreover, the new algorithm uses variable step-sizes which are updated at each iteration by a cheap computation without linesearch. This step-size rule allows the resulting algorithm to work more easily without the prior knowledge of Lipschitz constant of operator. Also, it is particularly interesting in the case where the Lipschitz constant is unknown or difficult to approximate. Several numerical experiments are implemented to illustrate the theoretical results and also to compare with existing algorithms. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to come up with an inertial extragradient method for dealing with a class of pseudomonotone equilibrium problems. This method can be a view as an extension of the paper title "A new two-step proximal algorithm of solving the problem of equilibrium programming" by Lyashko and Semenov et al. (Optimization and Its Applications in Control and Data Sciences: 315-325, 2016). The theorem of weak convergence for solutions of the pseudomonotone equilibrium problems is well-established under standard assumptions placed on cost bifunction in the structure of a real Hilbert spaces. For a numerical experiment, we take up a well-known Nash Cournot equilibrium model of electricity markets to support the well-established convergence results and be adequate to see that our proposed algorithms have a competitive superiority over the time of execution and the number of iterations. [ABSTRACT FROM AUTHOR]

In this research, we are interested about the monotone inclusion problems in the scope of the real Hilbert spaces by using an inertial forward–backward splitting algorithm. In addition, we have discussed the application of this algorithm. [ABSTRACT FROM AUTHOR]

In this paper, first, we introduce a new iterative algorithm involving demicontractive mappings in Hilbert spaces and, second, we prove some strong convergence theorems of the proposed method with the Armijo-line search to show the existence of a solution of the split common fixed point problem. Finally, we give some numerical examples to illustrate our main results. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce a general iterative method for finding a common element of the set of common fixed points of an infinite family of nonexpansive mappings and the set of split variational inclusion problem in the framework Hilbert spaces. Strong convergence theorem of the sequences generated by the purpose iterative scheme is obtained. In the last section, we present some computational examples to illustrate the assumptions of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we consider a common solution of three problems in Hilbert spaces including the split generalized equilibrium problem, the variational inequality problem and fixed point problem. For finding the solution, we present a new iterative method and prove the strongly convergence theorem under mild conditions. Moreover, some numerical examples are given in the last section. [ABSTRACT FROM PUBLISHER]

In this paper, we prove some strong and Δ-convergence theorems of the modified S-iteration for (α, β)-generalized hybrid mappings in CAT(0) spaces. Our results improve and extend the corresponding recent results announced in [1] and some papers. [ABSTRACT FROM AUTHOR]

In this paper, we study a modified extragradient method for computing a common solution to the split equilibrium problem and fixed point problem of a nonexpansive semigroup in real Hilbert spaces. The weak and strong convergence characteristics of the proposed algorithm are investigated by employing suitable control conditions in such a setting of spaces. As a consequence, we provide a simplified analysis of various existing results concerning the extragradient method in the current literature. We also provide a numerical example to strengthen the theoretical results and the applicability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Iterative algorithms are widely applied to solve convex optimization problems under a suitable set of constraints. In this paper, we develop an iterative algorithm whose architecture comprises a modified version of the forward-backward splitting algorithm and the hybrid shrinking projection algorithm. We provide theoretical results concerning weak and strong convergence of the proposed algorithm towards a common solution of the monotone inclusion problem and the split mixed equilibrium problem in Hilbert spaces. Moreover, numerical experiments compare favorably the efficiency of the proposed algorithm with the existing algorithms. As a consequence, our results improve various existing results in the current literature. [ABSTRACT FROM AUTHOR]

In this article, we propose a new modified extragradient-like method to solve pseudomonotone equilibrium problems in real Hilbert space with a Lipschitz-type condition on a bifunction. This method uses a variable stepsize formula that is updated at each iteration based on the previous iterations. The advantage of the method is that it operates without prior knowledge of Lipschitz-type constants and any line search method. The weak convergence of the method is established by taking mild conditions on a bifunction. In the context of an application, fixed-point theorems involving strict pseudo-contraction and results for pseudomonotone variational inequalities are considered. Many numerical results have been reported to explain the numerical behavior of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we presented a modification of the extragradient method to solve pseudomonotone equilibrium problems involving the Lipschitz-type condition in a real Hilbert space. The method uses an inertial effect and a formula for stepsize evaluation, that is updated for each iteration based on some previous iterations. The key advantage of the algorithm is that it is achieved without previous knowledge of the Lipschitz-type constants and also without any line search procedure. A weak convergence theorem for the proposed method is well established by assuming mild cost bifunction conditions. Many numerical experiments are presented to explain the computational performance of the method and to equate them with others. [ABSTRACT FROM AUTHOR]

In this paper, we propose two modified two-step proximal methods that are formed through the proximal-like mapping and inertial effect for solving two classes of equilibrium problems. A weak convergence theorem for the first method and the strong convergence result of the second method are well established based on the mild condition on a bifunction. Such methods have the advantage of not involving any line search procedure or any knowledge of the Lipschitz-type constants of the bifunction. One practical reason is that the stepsize involving in these methods is updated based on some previous iterations or uses a stepsize sequence that is non-summable. We consider the well-known Nash–Cournot equilibrium models to support our well-established convergence results and see the advantage of the proposed methods over other well-known methods. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new method, which is set up by incorporating an inertial step with the extragradient method for solving a strongly pseudomonotone equilibrium problems. This method had to comply with a strongly pseudomonotone property and a certain Lipschitz-type condition of a bifunction. A strong convergence result is provided under some mild conditions, and an iterative sequence is accomplished without previous knowledge of the Lipschitz-type constants of a cost bifunction. A sufficient explanation is that the method operates with a slow-moving stepsize sequence that converges to zero and non-summable. For numerical explanations, we analyze a well-known equilibrium model to support our well-established convergence result, and we can see that the proposed method seems to have a significant consistent improvement over the performance of the existing methods. [ABSTRACT FROM AUTHOR]

Based on the very recent work by Shehu and Agbebaku in Comput. Appl. Math. 2017, we introduce an extension of their iterative algorithm by combining it with inertial extrapolation for solving split inclusion problems and fixed point problems. Under suitable conditions, we prove that the proposed algorithm converges strongly to common elements of the solution set of the split inclusion problems and fixed point problems. [ABSTRACT FROM AUTHOR]

In this paper, we modify the general iterative method to approximate a common element of the set of solutions of split variational inclusion problem and the set of common fixed points of a finite family of k -strictly pseudo-contractive nonself mappings. Strong convergence theorem is established under some suitable conditions in a real Hilbert space, which also solves some variational inequality problems. Results presented in this paper may be viewed as a refinement and important generalizations of the previously known results announced by many other authors. Finally, some examples to study the rate of convergence and some illustrative numerical examples are presented. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a hybrid viscosity approximation scheme for finding a common element of the solution set for a system of equilibrium problems, the solution set for a system of variational inequality problems and the common fixed point set for an infinite family of nonexpansive mappings in Hilbert spaces. Then we prove the strong convergence of the proposed iterative scheme. Our results improve and extend the results announced by Ceng and Yao (2008) [4]. [ABSTRACT FROM AUTHOR]