#### Abstract

We suggest and analyze some implicit iterative methods for solving the extended general nonconvex variational inequalities using the projection technique. We show that the convergence of these iterative methods requires only the gh-pseudomonotonicity, which is a weaker condition than gh-monotonicity. We also discuss several special cases. Our method of proof is very simple as compared with other techniques.

#### 1. Introduction

Variational inequalities, which were introduced and studied in early sixties, contain wealth of new ideas. Variational inequalities can be considered as a natural extension of the variational principles. It is well known that the variational inequalities characterize the optimality conditions of the differentiable convex functions on the convex sets in normed spaces. In recent years, Noor [1β6] has introduced and studied a new class of variational inequalities involving three different operators, which is called the extended general variational inequalities. Noor [1β6] has shown that the minimum of a differentiable nonconvex (-convex) function on the nonconvex set (-convex) can be characterized by the class of extended general variational inequalities. The class of extended general variational include the general variational inequalities [1β33] and variational inequalities as special cases. This clearly shows that the extended general variational inequalities are more general and unifying ones. For applications, physical formulation, numerical methods, and other aspects of variational inequalities, see [1β35] and the references therein. However, all the work carried out in this direction assumes that the underlying set is a convex set. In many practical situations, a choice set may not be a convex set so that the existing results may not be applicable. To handle such situations, Noor [20β25] has introduced and considered a new class of variational inequalities, called the general nonconvex variational inequality on the uniformly prox-regular sets. It is well known that uniformly prox-regular sets are nonconvex and include the convex sets as special cases, see [8, 9, 32]. Using the projection operator, Noor [27] proved a new characterization of the projection operator for the prox-regular sets. Using this characterization, one can easily show that nonconvex projection operator is Lipschitz continuous, which is a new result. Using this new characterization of the projection of the prox-regular sets, one can establish the equivalence between the nonconvex variational inequalities and the fixed point problems. This equivalence is useful to study various concepts for the nonconvex variational inequalities.

Motivated and inspired by the recent activities in this dynamic field, we consider the extended general noncomvex variational inequalities on the prox-regular sets. We use the projection technique to establish the equivalence between the extended general nonconvex variational inequalities and the fixed point problems. We use this alternative formulation to some unified implicit and extragradient methods for solving the extended general nonconvex variational inequalities. These new methods include the modified projection method of Noor [27] and the extragradient method of KorpeleviΔ [11] as special cases. The main motivation of this paper is to improve the convergence criteria. We show that the convergence of the implicit iterative methods requires only the -pseudomonotonicity, which is weaker condition that -monotonicity. It is worth mentioning that we do not need the Lipschitz continuity of the operator. In this sense, our result represents an improvement and refinement of the known results. Our method of proof is very simple.

#### 2. Basic Concepts

Let be a real Hilbert space whose inner product and norm are denoted by and , respectively. Let be a nonempty closed convex set in . The basic concepts and definitions used in this paper are exactly the same as in Noor [20, 22]. We now recall some basic concepts and results from nonsmooth analysis [9, 32].

Definition 2.1 (see [9, 32]). The proximal normal cone of at is given by where is a constant and Here is the usual distance function to the subset , that is,

The proximal normal cone has the following characterization.

Lemma 2.2. Let be a nonempty, closed and convex subset in . Then , if and only if, there exists a constant such that

Definition 2.3. The Clarke normal cone, denoted by , is defined as where means the closure of the convex hull. Clearly , but the converse is not true. Note that is always closed and convex, whereas is convex, but may not be closed [32].

Definition 2.4 (see [29]). For a given , a subset is said to be normalized uniformly -prox-regular if and only if every nonzero proximal normal to can be realized by an -ball, that is, for all and , one has It is clear that the class of normalized uniformly prox-regular sets is sufficiently large to include the class of convex sets, -convex sets, submanifolds (possibly with boundary) of , the images under a diffeomorphism of convex sets, and many other nonconvex sets, see [11, 29]. It is well known [9, 32] that the union of two disjoint intervals and is a prox regular set with Obviously, for , the uniformly prox-regularity of is equivalent to the convexity of . This class of uniformly prox-regular sets have played an important part in many nonconvex applications such as optimization, dynamic systems, and differential inclusions. It is known that if is a uniformly prox-regular set, then the proximal normal cone is closed as a set-valued mapping.

We now recall the well-known proposition which summarizes some important properties of the uniformly prox-regular sets .

Lemma 2.5. Let be a nonempty closed subset of and set . If is uniformly prox-regular, then(i), (ii) is Lipschitz continuous with constant on .

For given nonlinear operators , we consider the problem of finding such that which is called the extended general nonconvex variational inequality. Here and are constants.

We remark that if , then problem (2.7) is equivalent to finding such that which is called the general nonconvex variational inequality, introduced and studied by Noor [27].

We note that, if , the convex set in , then problem (2.7) is equivalent to finding such that which is known as the extended general variational inequality, introduced and studied by Noor [1β6]. For the applications, numerical methods, formulation, and other aspects of the extended general variational inequalities (2.8), see [1β6, 30, 31] and the references therein.

If , the identity operator, then both problems (2.7) and (2.8) are equivalent to finding such that which is called the nonconvex variational inequality. For the formulation and numerical methods for the nonconvex variational inequalities, see [3, 8, 18β27].

We note that if , the convex set in , then problem (2.8) is equivalent to finding such that Inequality of type (2.11) is called the general variational inequality involving two operators, which was introduced and studied by Noor [14] in 1988. It has been shown that the minimum of the differentiable -convex function on a -convex set can be characterized by the general variational inequality of type (3.4). It has been shown that a wide class of odd-order and nonsymmetric problems can be studied via the general variational inequalities. For the numerical method, sensitivity analysis, dynamical systems, and other aspects of general variational inequalities, see [7, 15, 16]. For , the identity operator, one can obtain the original variational inequality, which was introduced and studied by Stampacchia [33] in 1964. It turned out that a number of unrelated obstacle, free, moving, unilateral, and equilibrium problems arising in various branches of pure and applied sciences can be studied via variational inequalities, see [1β35] and the references therein.

If is a nonconvex (uniformly prox-regular) set, then problem (2.7) is equivalent to finding such that which is called the extended general nonconvex variational inclusion problem associated with general nonconvex variational inequality (2.7). Here denotes the normal cone of at in the sense of nonconvex analysis. This equivalent formulation plays a crucial and basic part in this paper. We would like to point out that this equivalent formulation allows us to use the projection operator technique for solving the general nonconvex variational inequalities of the type (2.7).

We now prove that the projection operator has the following characterization for the prox-regular sets. This result is due to Noor [27]. We include its proof for the sake of completeness and to convey an idea of the technique.

Lemma 2.6 (see [27]). Let be a prox-regular and closed set in . Then, for a given satisfies the inequality if and only if, where is the projection of onto the prox-regular set .

Proof. Let . Then, for given , we have where is the projection operator.

We note that, if , the closed convex set, then Lemma 2.6 is a well-known result, see [10]. Using Lemma 2.6, one can easily prove that the nonconvex projection operator is Lipschitz continuous.

Definition 2.7. An operator with respect to the arbitrary operators is said to be -pseudomonotone, if and only if,

#### 3. Main Results

It is known that the extended general nonconvex variational inequalities (2.7) are equivalent to the fixed point problem. One can also prove this result using Lemma 2.6.

Lemma 3.1. is a solution of the general nonconvex variational inequality (2.7) if and only if satisfies the relation where is the projection of onto the uniformly prox-regular set .

Lemma 3.1 implies that (2.7) is equivalent to the fixed point problem (3.1). This alternative equivalent formulation is very useful from the numerical and theoretical points of view. Using the fixed point formulation (3.1), we suggest and analyze the following iterative methods for solving the extended general nonconvex variational inequality (2.7).

Algorithm 3.2. For a given , find the approximate solution by the iterative scheme which is called the explicit iterative method. For the convergence analysis of Algorithm 3.2, see Noor [19].

We again use the fixed point formulation is used to suggest and analyze the following iterative method for solving (2.7).

Algorithm 3.3. For a given , find the approximate solution by the iterative scheme Algorithm 3.3 is an implicit iterative method for solving the extended general nonconvex variational inequalities (2.7) and is a new one. Using Lemma 2.6, one can rewrite Algorithm 3.3 in the following equivalent form.

Algorithm 3.4. For a given , find the approximate solution by the iterative schemes

To implement Algorithm 3.3, we use the predictor-corrector technique. We use Algorithm 3.2 as predictor and Algorithm 3.3 as a corrector to obtain the following predictor-corrector method for solving the extended general nonconvex variational inequality (2.7).

Algorithm 3.5. For a given , find the approximate solution by the iterative schemes

Algorithm 3.5 is known as the extended extragradient method. This method includes the extragradient method of KorpeleviΔ [11] for . Here we would like to point out that the implicit method (Algorithm 3.3) and the extragradient method (Algorithm 3.5) are equivalent.

We now consider the convergence analysis of Algorithm 3.3, and this is the main motivation of our next result.

Theorem 3.6. Let be a solution of (2.7) and let be the approximate solution obtained from Algorithm 3.3. If the operator is -pseudomonotone, then

Proof. Let be a solution of (2.7). Then since the operator is -pseudomonotone. Take in (3.7), we have Taking in (3.4), we have From (3.8) and (3.9), we have It is well known that Using (3.11), from (3.10), one can easily obtain the required result (3.6).

Theorem 3.7. Let be a solution of (2.7) and let be the approximate solution obtained from Algorithm 3.3. Let be a finite dimensional space. Then .

Proof. Let be a solution of (2.7). Then, the sequence is nonincreasing and bounded and which implies Let be a cluster point of . Then, there exists a subsequence such that converges to . Replacing by in (3.4), taking the limits in (3.4) and using (3.14), we have This shows that solves the extended general nonconvex variational inequality (2.7) and which implies that the sequence has a unique cluster point, and is the solution of (2.7), the required result.

We again use the fixed point formulation (3.1) to suggest the following method for solving (2.7).

Algorithm 3.8. For a given , find the approximate solution by the iterative schemes which is also known an implicit method. To implement this method, we use the prediction-correction technique. We use Algorithm 3.2 as the predictor and Algorithm 3.8 as the corrector. Consequently, we obtain the following iterative method.

Algorithm 3.9. For a given , find the approximate solution by the iterative schemes: Algorithm 3.9 is called the two-step or predictor-corrector method for solving the extended general nonconvex variational inequality (2.7).

For a given step size , one can suggest and analyze the following two-step iterative method.

Algorithm 3.10. For a given , find the approximate solution by the iterative schemes: Note that for , Algorithm 3.10 reduces to Algorithm 3.9. Using the technique of Noor [16], one may study the convergence analysis of Algorithms 3.9 and 3.10.

#### 4. Conclusion

In this paper, we have introduced and considered a new class of general variational inequalities, which is called the general nonconvex variational inequalities. Some new characterizations of the nonconvex projection operator are proved. We have established the equivalent between the general nonconvex variational inequalities and fixed point problem using the technique of the projection operator. This equivalence is used to suggest and analyze some iterative methods for solving the nonconvex general variational inequalities. Several special cases are also discussed. Results proved in this paper can be extended for multivalued and system of general nonconvex variational inequalities using the technique of this paper. The comparison of the iterative method for solving nonconvex general variational inequalities is an interesting problem for future research. We hope that the ideas and technique of this paper may stimulate further research in this field.

#### Acknowledgment

This research is supported by the Visiting Professorship Program of King Saud University, Riyadh, Saudi Arabia, and Research Grant no. KSU.VPP.108. The research of Z. Huang is supported by National Natural Science Foundation of China (NSFC Grant no. 10871092), supported by the Fundamental Research Funds for the Central University of China (Grant no. 1113020301 and Grant no. 1116020301), and supported by A Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD Grant). The authors are also grateful to Dr. S. M. Junaid Zaidi, Rector, COMSATS Institute of Information Technology, Pakistan, for providing the excellent research facilities.