Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces

In this paper, we study the split common fixed point and monotone variational inclusion problem in uniformly convex and 2-uniformly smooth Banach spaces. We propose a Halpern-type algorithm with two self-adaptive stepsizes for obtaining solution of the problem and prove strong convergence theorem for the algorithm. Many existing results in literature are derived as corollary to our main result. In addition, we apply our main result to split common minimization problem and fixed point problem and illustrate the efficiency and performance of our algorithm with a numerical example. The main result in this paper extends and generalizes many recent related results in the literature in this direction.

     

An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping

In this paper, we introduce and study an iterative method to approximate a common solution of split variational inclusion problem and fixed point problem for a nonexpansive mapping in real Hilbert spaces. Further, we prove that the sequences generated by the proposed iterative method converge strongly to a common solution of split variational inclusion problem and fixed point problem for a nonexpansive mapping which is the unique solution of the variational inequality problem. The results presented in this paper are the supplement, extension and generalization of the previously known results in this area.     

A new iterative method for the split common fixed point problem in Hilbert spaces

The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we propose a new algorithm for this problem that is completely different from the existing algorithms. Moreover, our algorithm does not need any prior information of the operator norm. Under standard assumptions, we establish a weak convergence theorem of the proposed algorithm and a strong convergence theorem of its variant.     

Several iterative algorithms for solving the split common fixed point problem of directed operators with applications

In this paper, we propose a new simultaneous iterative algorithm for solving the split common fixed point problem of directed operators. Inspired by the idea of cyclic iterative algorithm, we also introduce two iterative algorithms which combine the process of cyclic and simultaneous together. Under mild assumptions, we prove convergence of the proposed iterative sequences. As applications, we obtain several iteration schemes to solve the inverse problem of multiple-sets split feasibility problem. Numerical experiments are presented to confirm the efficiency of the proposed iterative algorithms.     

A cyclic iterative method for solving a class of variational inequalities in Hilbert spaces

ABSTRACT

The purpose of this paper is to introduce a new iterative method for solving a variational inequality over the set of common fixed points of a finite family of sequences of nearly non-expansive mappings in a real Hilbert space. And, using this result, we give some applications to the problem of finding a common fixed point of non-expansive mappings or non-expansive semigroups and the problem of finding a common null point of monotone operators.     

A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping

Many problems to appear in signal processing have been formulated as the variational inequality problem over the fixed point set of a nonexpansive mapping. In particular, convex optimization problems over the fixed point set are discussed, and operators which are considered to the problems satisfy the monotonicity. Hence, the uniqueness of the solution of the problem is not always guaranteed. In this article, we present the variational inequality problem for a monotone, hemicontinuous operator over the fixed point set of a firmly nonexpansive mapping. The main aim of the article is to solve the proposed problem by using an iterative algorithm. To this goal, we present a new iterative algorithm for the proposed problem and its convergence analysis. Numerical examples for the proposed algorithm for convex optimization problems over the fixed point set are provided in the final section.     

A projection-fixed point method for a class of bilevel variational inequalities with split fixed point constraints

We propose a method for solving bilevel split variational inequalities involving strongly monotone operators in the leader problems and nonexpansive mappings in the follower ones. The proposed method is a combination between the projection method for variational inequality and the Krasnoselskii–Mann scheme for fixed points of nonexpansive mappings. Strong convergence of the iterative process is proved. Special cases are considered.     

A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem

In this article, we first propose an extended split equality problem which is an extension of the convex feasibility problem, and then introduce a parameter w to establish the fixed point equation system. We show the equivalence of the extended split equality problem and the fixed point equation system. Based on the fixed point equation system, we present a simultaneous iterative algorithm and obtain the weak convergence of the proposed algorithm. Further, by introducing the concept of a G-mapping of a finite family of strictly pseudononspreading mappings \(\{T_{i}\}_{i = 1}^{N}\), we consider an extended split equality fixed point problem for G-mappings and give a simultaneous iterative algorithm with a way of selecting the stepsizes which do not need any prior information about the operator norms, and the weak convergence of the proposed algorithm is obtained. We apply our iterative algorithms to some convex and nonlinear problems. Finally, several numerical results are shown to confirm the feasibility and efficiency of the proposed algorithms.     

An efficient iterative method for finding common fixed point and variational inequalities in Hilbert spaces

ABSTRACT

In this paper, we investigate the problem of finding a common solution to a fixed point problem involving demi-contractive operator and a variational inequality with monotone and Lipschitz continuous mapping in real Hilbert spaces. Inspired by the projection and contraction method and the hybrid descent approximation method, a new and efficient iterative method for solving the problem is introduced. Strong convergence theorem of the proposed method is established under standard and mild conditions. Our scheme generalizes and extends some of the existing results in the literature, and moreover, its computational effort is less per each iteration compared with related works.     

Iterative approximation of a common solution of a split equilibrium problem,a variational inequality problem and a fixed point problem

In this paper, we introduce an iterative method to approximate a common solution of a split equilibrium problem, a variational inequality problem and a fixed point problem for a nonexpansive mapping in real Hilbert spaces. We prove that the sequences generated by the iterative scheme converge strongly to a common solution of the split equilibrium problem, the variational inequality problem and the fixed point problem for a nonexpansive mapping. The results presented in this paper extend and generalize many previously known results in this research area.     

Projection iterative method for solving general variational inequalities

In this paper, we suggest and analyze a new projection iterative method for solving general variational inequalities by using a new step size. We also prove the global convergence of the proposed method under some suitable conditions. Some preliminary numerical experiments are included to illustrate the advantage and efficiency of the proposed method.     

Hybrid iterative method for split monotone variational inclusion problem and hierarchical fixed point problem for a finite family of nonexpansive mappings

In this paper, we propose a hybrid iterative method to approximate a common solution of split monotone variational inclusion problem and hierarchical fixed point problem for a finite family of nonexpansive mappings in real Hilbert spaces. We prove that sequences generated by the proposed hybrid iterative method converge strongly to a common solution of these problems. Further, we discuss some applications of the main result. We also discuss a numerical example to demonstrate the applicability of the iterative method. The method and results presented in this paper extend and unify the corresponding known results in this area.     

A self-adaptive iterative algorithm for the split common fixed point problems

Numerical Algorithms - In this paper, we use the dual variable to propose a self-adaptive iterative algorithm for solving the split common fixed point problems of averaged mappings in real Hilbert...     

A new iterative method for solving split feasibility problem

In this paper, we construct a new iterative algorithm and show that the newly introduced iterative algorithm converges faster than a number of existing iterative algorithms for contractive-like mappings. We present a numerical example followed by graphs to validate our claim. We prove strong and weak convergence results for approximating fixed points of generalized $\alpha$-nonexpansive mappings. Again we reconfirm our results by an example and table. Further, we utilize our proposed algorithm to solve split feasibility problem.     

An inertial subgradient-type method for solving single-valued variational inequalities and fixed point problems

In this paper, we introduce an inertial subgradient-type algorithm to find the common element of fixed point set of a family of nonexpansive mappings and the solution set of the single-valued variational inequality problem. Under the assumption that the mapping is monotone and Lipschitz continuous, we show that the sequence generated by our algorithm converges strongly to some common element of the fixed set and the solution set. Moreover, preliminary numerical experiments are also reported.     

A projected subgradient method for solving generalized mixed variational inequalities

We consider the projected subgradient method for solving generalized mixed variational inequalities. In each step, we choose an ε_k-subgradient u^k of the function f and w^k in a set-valued mapping T, followed by an orthogonal projection onto the feasible set. We prove that the sequence is weakly convergent.     

Krasnoselski-Mann type iterative method for hierarchical fixed point problem and split mixed equilibrium problem

In this paper, we suggest and analyze a Krasnoselski-Mann type iterative method to approximate a common element of solution sets of a hierarchical fixed point problem for nonexpansive mappings and a split mixed equilibrium problem. We prove that sequences generated by the proposed iterative method converge weakly to a common element of solution sets of these problems. Further, we derive some consequences from our main result. Furthermore, we extend the considered iterative method to a split monotone variational inclusion problem and deduce some consequences. Finally, we give a numerical example to justify the main result. The method and results presented in this paper generalize and unify the corresponding known results in this area.     

A hybrid extragradient method for approximating the common solutions of a variational inequality, a system of variational inequalities, a mixed equilibrium problem and a fixed point problem

In this paper, we give a hybrid extragradient iterative method for finding the approximate element of the common set of solutions of a generalized equilibrium problem, a system of variational inequality problems, a variational inequality problem and a fixed point problem for a strictly pseudocontractive mapping in a real Hilbert space. Further we establish a strong convergence theorem based on this method. The results presented in this paper improves and generalizes the results given in Yao et al. [36] and Ceng et al. [7], and some known corresponding results in the literature.     

Mann type iterative methods for finding a common solution of split feasibility and fixed point problems

The purpose of this paper is to study and analyze three different kinds of Mann type iterative methods for finding a common element of the solution set ?? of the split feasibility problem and the set Fix(S) of fixed points of a nonexpansive mapping S in the setting of infinite-dimensional Hilbert spaces. By combining Mann??s iterative method and the extragradient method, we first propose Mann type extragradient-like algorithm for finding an element of the set ${{{\rm Fix}}(S) \cap \Gamma}$ ; moreover, we derive the weak convergence of the proposed algorithm under appropriate conditions. Second, we combine Mann??s iterative method and the viscosity approximation method to introduce Mann type viscosity algorithm for finding an element of the ${{{\rm Fix}}(S)\cap \Gamma}$ ; moreover, we derive the strong convergence of the sequences generated by the proposed algorithm to an element of set ${{{\rm Fix}}(S) \cap \Gamma}$ under mild conditions. Finally, by combining Mann??s iterative method and the relaxed CQ method, we introduce Mann type relaxed CQ algorithm for finding an element of the set ${{{\rm Fix}}(S)\cap \Gamma}$ . We also establish a weak convergence result for the sequences generated by the proposed Mann type relaxed CQ algorithm under appropriate assumptions.