Search

This article proposes two general inertial algorithms with line-search process for finding a solution of a variational inequality problem with fixed-point constraints via a subgradient-extragradient approach. Common solution theorems are obtained in Hilbert spaces. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce a general viscosity implicit iterative method for finding a solution of a split variational inclusion problem (SVIP) with a hierarchical variational inequality (HVI) constraint for a countable family of nonexpansive mappings in Hilbert spaces. Strong convergence theorem is obtained under some mild assumptions [ABSTRACT FROM AUTHOR]

We introduce and analyze a relaxed iterative algorithm by combining Korpelevich’s extragradient method, hybrid steepest-descent method, and Mann’s iteration method. We prove that, under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of infinitely many nonexpansive mappings, the solution set of finitely many generalized mixed equilibrium problems (GMEPs), the solution set of finitely many variational inclusions, and the solution set of general system of variational inequalities (GSVI), which is just a unique solution of a triple hierarchical variational inequality (THVI) in a real Hilbert space. In addition, we also consider the application of the proposed algorithm for solving a hierarchical variational inequality problem with constraints of finitely many GMEPs, finitely many variational inclusions, and the GSVI. The results obtained in this paper improve and extend the corresponding results announced by many others. [ABSTRACT FROM AUTHOR]

We suggest and analyze relaxed extragradient iterative algorithms with regularization for finding a common element of the solution set of a general system of variational inequalities, the solution set of a split feasibility problem, and the fixed point set of a strictly pseudocontractive mapping defined on a real Hilbert space. Here the relaxed extragradient methods with regularization are based on the well-known successive approximation method, extragradient method, viscosity approximation method, regularization method, and so on. Strong convergence of the proposed algorithms under some mild conditions is established. Our results represent the supplementation, improvement, extension, and development of the corresponding results in the very recent literature. [ABSTRACT FROM AUTHOR]

In this article, we consider a monotone variational inequality with variational inequality constraint over the set of fixed points of a nonexpansive mapping, which is called a triple-hierarchical variational inequality (THVI). A relaxed hybrid steepest-descent method with variable parameters is introduced for solving the THVI. Strong convergence of the method to a unique solution of the THVI is studied under certain assumptions. We also investigate another monotone variational inequality with the variational inequality constraint over the set of common fixed points of a finite family of nonexpansive mappings, and present an iterative algorithm for solving such kind of problems. It is proven that under mild conditions the sequence generated by the proposed algorithm converges strongly to a unique solution of later problem. [ABSTRACT FROM AUTHOR]

We introduce a new implicit iterative scheme with perturbation for finding the approximate solutions of a hierarchical variational inequality, that is, a variational inequality over the common fixed point set of a finite family of nonexpansive mappings. We establish some convergence theorems for the sequence generated by the proposed implicit iterative scheme. In particular, necessary and sufficient conditions for the strong convergence of the sequence are obtained. [ABSTRACT FROM AUTHOR]

We consider a triple hierarchical variational inequality problem (in short, THVIP). By combining hybrid steepest descent method, viscosity method, and projection method, we propose an approximation method to compute the approximate solution of THVIP. We also study the strong convergence of the sequences generated by the proposed method to a solution of THVIP. [ABSTRACT FROM AUTHOR]

Abstract: The present paper is divided into two parts. In the first part, we introduce implicit and explicit iterative schemes for finding the fixed point of a nonexpansive mapping defined on the closed convex subset of a real Hilbert space. We establish results on the strong convergence of the sequences generated by the proposed schemes to a fixed point of a nonexpansive mapping. Such a fixed point is also a solution of a variational inequality defined on the set of fixed points. In the second part, we propose implicit and explicit iterative schemes for finding the approximate minimizer of a constrained convex minimization problem and prove that the sequences generated by our schemes converge strongly to a solution of the constrained convex minimization problem. Such a solution is also a solution of a variational inequality defined over the set of fixed points of a nonexpansive mapping. The results of this paper extend and improve several results presented in the literature in the recent past. [Copyright &y& Elsevier]

Abstract: In this paper, we suggest and analyze a relaxed viscosity iterative method for a commutative family of nonexpansive self-mappings defined on a nonempty closed convex subset of a reflexive Banach space. We prove that the sequence of approximate solutions generated by the proposed iterative algorithm converges strongly to a solution of a variational inequality. Our relaxed viscosity iterative method is an extension and variant form of the original viscosity iterative method. The results of this paper can be viewed as an improvement and generalization of the previously known results that have appeared in the literature. [Copyright &y& Elsevier]

Let C be a nonempty closed convex subset of a Banach space E with the dual E*, let T : C → E* be a continuous mapping, and let S : C → C be a relatively nonexpansive mapping. In this paper, by employing the notion of generalized projection operator we study the variational inequality (for short, VI(T - f,C)): find x ϵ C such that ⩾ 0 for all y ϵ C, where f ϵ E* is a given element. By combining the approximate proximal point scheme both with the modified Ishikawa iteration and with the modified Halpern iteration for relatively nonexpansive mappings, respectively, we propose two modified versions of the approximate proximal point scheme L. C. Ceng and J. C. Yao (2008) for finding approximate solutions of the VI(T - f,C). Moreover, it is proven that these iterative algorithms converge strongly to the same solution of the VI(T - f,C), which is also a fixed point of S. [ABSTRACT FROM AUTHOR]

In this paper, we consider a generalized vector variational-like inequality problem (for short, GVVLIP), which includes generalized vector variational inequalities, vector variational inequalities and classical variational inequalities as special cases. The concepts of generalized C-pseudomonotone-like and generalized H-hemicontinuous-like operators are introduced. Some existence results for GVVLIP are obtained under the assumptions of generalized C-pseudomonotone-like property and generalized H-hemicontinuous-like property. These results appear to be new and interesting. New existence results of the classical variational inequality are also obtained. [ABSTRACT FROM AUTHOR]