Search

We investigate the problem of finding a common solution of a general system of variational inequalities, a variational inclusion, and a fixed-point problem of a strictly pseudocontractive mapping in a real Hilbert space. Motivated by Nadezhkina and Takahashi's hybrid-extragradient method, we propose and analyze new hybrid-extragradient iterative algorithm for finding a common solution. It is proven that three sequences generated by this algorithm converge strongly to the same common solution under very mild conditions. Based on this result, we also construct an iterative algorithm for finding a common fixed point of three mappings, such that one of these mappings is nonexpansive, and the other two mappings are strictly pseudocontractive mappings. [ABSTRACT FROM AUTHOR]

Very recently, Ahmad and Yao 2009( introduced and considered a system of generalized resolvent equationswith corresponding system of variational inclusions in uniformly smooth Banach spaces. In this paper we introduce and study a general system of generalized resolvent equations with corresponding general system of variational inclusions in uniformly smooth Banach spaces. We establish an equivalence relation between general system of generalized resolvent equations and general system of variational inclusions. The iterative algorithms for finding the approximate solutions of general system of generalized resolvent equations are proposed. The convergence criteria of approximate solutions of general system of generalized resolvent equations obtained by the proposed iterative algorithm are also presented. Our results represent the generalization, improvement, supplement, and development of Ahmad and Yao corresponding ones. [ABSTRACT FROM AUTHOR]

Assume that F is a nonlinear operator which is Lipschitzian and strongly monotone on a nonempty closed convex subset C of a real Hilbert space H. Assume also that Ω is the intersection of the fixed point sets of a finite number of Lipschitzian pseudocontractive self-mappings on C. By combining hybrid steepest-descent method, Mann's iteration method and projection method, we devise a hybrid iterative algorithm with perturbation F, which generates two sequences from an arbitrary initial point x0 є H. These two sequences are shown to converge in norm to the same point PΩx0 under very mild assumptions. [ABSTRACT FROM AUTHOR]

We consider an extension of the notion of well-posedness by perturbations, introduced by Zolezzi (1995, 1996) for a minimization problem, to a class of generalized mixed variational inequalities in Banach spaces, which includes as a special case the class of mixed variational inequalities. We establish some metric characterizations of the well-posedness by perturbations. On the other hand, it is also proven that, under suitable conditions, the well-posedness by perturbations of a generalized mixed variational inequality is equivalent to the well-posedness by perturbations of the corresponding inclusion problem and corresponding fixed point problem. Furthermore, we derive some conditions under which the well-posedness by perturbations of a generalized mixed variational inequality is equivalent to the existence and uniqueness of its solution. [ABSTRACT FROM AUTHOR]