Projection algorithms for solving a system of general variational inequalities

In this paper, we introduce and consider a new system of general variational inequalities involving four different operators. Using the projection operator technique, we suggest and analyze some new explicit iterative methods for this system of variational inequalities. We also study the convergence analysis of the new iterative method under certain mild conditions. Since this new system includes the system of variational inequalities involving three operators, variational inequalities and related optimization problems as special cases, results obtained in this paper continue to hold for these problems. Our results can be viewed as a refinement and improvement of the previously known results for variational inequalities.     

Self-adaptive methods for general variational inequalities

It is well known that the general variational inequalities are equivalent to the fixed point problems and the Wiener-Hopf equations. In this paper, we use these alternative equivalent formulations to suggest and analyze some new self-adaptive iterative methods for solving the general variational inequalities. Our results can be viewed as a significant extension of the previously known results for variational inequalities. An example is given to illustrate the efficiency of the proposed method.     

Levitin-Polyak well-posedness of variational inequalities

In this paper we consider the Levitin-Polyak well-posedness of variational inequalities. We derive a characterization of the Levitin-Polyak well-posedness by considering the size of Levitin-Polyak approximating solution sets of variational inequalities. We also show that the Levitin-Polyak well-posedness of variational inequalities is closely related to the Levitin-Polyak well-posedness of minimization problems and fixed point problems. Finally, we prove that under suitable conditions, the Levitin-Polyak well-posedness of a variational inequality is equivalent to the uniqueness and existence of its solution.     

An existence theorem for generalized quasi-variational inequalities

In this paper, we deal with the following generalized quasi-variational inequality problem: given a closed convex subsetX ⁿ , a multifunction :X 2 ⁿ and a multifunction :X 2 ^X , find a point ( ) X × ⁿ such that We prove an existence theorem in which, in particular, the multifunction is not supposed to be upper semicontinuous.     

Homotopy method for solving ball-constrained variational inequalities

In this paper, we present a smoothing homotopy method for solving ball-constrained variational inequalities by utilizing a similar Chen-Harker-Kanzow-Smale function to smooth Robinson’s normal equation. Without any monotonicity condition on the defining map F, for the starting point chosen almost everywhere in Rⁿ, the existence and convergence of the homotopy pathway are proven. Numerical experiments illustrate that the method is feasible and effective.     

Iterative algorithms for a new class of extended general nonconvex set-valued variational inequalities

Some new classes of extended general nonconvex set-valued variational inequalities and the extended general Wiener-Hopf inclusions are introduced. By the projection technique, equivalence between the extended general nonconvex set-valued variational inequalities and the fixed point problems as well as the extended general nonconvex Wiener-Hopf inclusions is proved. Then by using this equivalent formulation, we discuss the existence of solutions of the extended general nonconvex set-valued variational inequalities and construct some new perturbed finite step projection iterative algorithms with mixed errors for approximating the solutions of the extended general nonconvex set-valued variational inequalities. We also verify that the approximate solutions obtained by our algorithms converge to the solutions of the extended general nonconvex set-valued variational inequalities. The results presented in this paper extend and improve some known results from the literature.     

Optimal control of multivalued quasi variational inequalities

Optimal control of various variational problems has been an area of active research. On the other hand, in recent years many important models in mechanics and economics have been formulated as multi-valued quasi variational inequalities. The primary objective of this work is to study optimal control of the general nonlinear problems of this type. Under suitable conditions, we ensure the existence of an optimal control for a quasi variational inequality with multivalued pseudo-monotone maps. Convergence behavior of the control is studied when the data for the state quasi variational inequality is contaminated by some noise. Some possible applications are discussed.     

An additional projection step to He and Liao's method for solving variational inequalities

In this paper, we proposed a modified extragradient method for solving variational inequalities. The method can be viewed as an extension of the method proposed by He and Liao [Improvement of some projection methods for monotone variational inequalities, J. Optim. Theory Appl. 112 (2002) 111–128], by performing an additional projection step at each iteration and another optimal step length is employed to reach substantial progress in each iteration. We used a self-adaptive technique to adjust parameter ρ$\rho$ at each iteration. Under certain conditions, the global convergence of the proposed method is proved. Preliminary numerical experiments are included to compare our method with some known methods.     

Stable monotone variational inequalities

Variational inequalities associated with monotone operators (possibly nonlinear and multivalued) and convex sets (possibly unbounded) are studied in reflexive Banach spaces. A variety of results are given which relate to a stability concept involving a natural parameter. These include characterizations useful as criteria for stable existence of solutions and also several characterizations of surjectivity. The monotone complementarity problem is covered as a special case, and the results are sharpened for linear monotone complementarity and for generalized linear programming.Sponsored by the United States Army under Contract No. DAAG29-80-C-0041 at the University of Wisconsin - Madison and by the National Science Foundation under Grant No. DMS-8405179 at the University of Illinois at Urbana-Champaign.     

Homotopy method for solving variational inequalities with bounded box constraints

In this paper, using the Gabriel–Moré smoothing function of the median function, a smooth homotopy method for solving nonsmooth equation reformulation of bounded box constrained variational inequality problem VIP(l,u,F$l,u,F$) is given. Without any monotonicity condition on the defining map F$F$, for starting point chosen almost everywhere in Rⁿ$R^n$, existence and convergence of the homotopy pathway are proven. Nevertheless, it is also proven that, if the starting point is chosen to be an interior point of the box, the proposed homotopy method can also serve as an interior point method.     

Projection methods for a generalized system of nonconvex variational inequalities with different nonlinear operators

In this paper, we introduce and consider a new generalized system of nonconvex variational inequalities with different nonlinear operators. We establish the equivalence between the generalized system of nonconvex variational inequalities and the fixed point problems using the projection technique. This equivalent alternative formulation is used to suggest and analyze a general explicit projection method for solving the generalized system of nonconvex variational inequalities. Our results can be viewed as a refinement and improvement of the previously known results for variational inequalities.     

System of vector quasi-variational inclusions with some applications

In this paper, we consider systems of vector quasi-variational inclusions which include systems of vector quasi-equilibrium problems for multivalued maps, systems of vector optimization problems and several other systems as special cases. We establish existence results for solutions of these systems. As applications of our results, we derive the existence results for solutions of system vector optimization problems, mathematical programs with systems of vector variational inclusion constraints and bilevel problems. Another application of our results provides the common fixed point theorem for a family of lower semicontinuous multivalued maps. Further applications of our results for existence of solutions of systems of vector quasi-variational inclusions are given to prove the existence of solutions of systems of Minty type and Stampacchia type generalized implicit quasi-variational inequalities. The results of this paper can be seen as extensions and generalizations of several known results in the literature.     

Existence of vector mixed variational inequalities in Banach spaces

The purpose of this paper is to study the solvability for vector mixed variational inequalities (for short, VMVI) in Banach spaces. Utilizing Ky Fan’s Lemma and Nadler’s theorem, we derive the solvability for VMVIs with compositely monotone vector multifunctions. On the other hand, we first introduce the concepts of compositely complete semicontinuity and compositely strong semicontinuity for vector multifunctions. Then we prove the solvability for VMVIs without monotonicity assumption by using these concepts and by applying Brouwer’s fixed point theorem. The results presented in this paper are extensions and improvements of some earlier and recent results in the literature.     

Levitin-Polyak well-posedness of a generalized mixed variational inequality in Banach spaces

In this paper, we first introduce the concept of Levitin-Polyak well-posedness of a generalized mixed variational inequality in Banach spaces and establish some characterizations of its Levitin-Polyak well-posedness. Under suitable conditions, we prove that the Levitin-Polyak well-posedness of a generalized mixed variational inequality is equivalent to the Levitin-Polyak well-posedness of a corresponding inclusion problem and a corresponding fixed point problem. We also derive some conditions under which a generalized mixed variational inequality in Banach spaces is Levitin-Polyak well-posed.     

On the existence of solutions to generalized vector variational-like inequalities

In this paper, we consider a vector version of generalized Minty's lemma and obtain existence theorems of solutions for two kinds of vector variational-like inequalities.     

On asymptotic properties for some parameter-dependent variational inequalities

This paper is concerned with asymptotic and monotonicity properties of some parameter-dependent variational inequalities. The main part of the study deals with inequalities modelling friction problems with normal compliance or Tresca’s conditions in which the parameter stands for the friction coefficient. The corresponding inequalities are (generalizations) of variational inequalities of the second kind. We then study an inequality of the first kind representing the elastoplastic torsion problem where the parameter represents the plasticity yield.     

Coderivatives of normal cone mappings and Lipschitzian stability of parametric variational inequalities

In this paper, we provide a comprehensive study of coderivative formulas for normal cone mappings. This allows us to derive necessary and sufficient conditions for the Lipschitzian stability of parametric variational inequalities in reflexive Banach spaces. Our development not only gives an answer to the open questions raised in Yao and Yen (2009) [11], but also establishes generalizations and complements of the results given in Henrion et al. (2010) [4] and Yao and Yen (2009) [11] and [12].     

An inexact implicit method for general mixed variational inequalities

In the present paper, we present an inexact implicit method with a variable parameter for general mixed variational inequalities. We use a self-adaptive technique to adjust parameter ρ$\rho$ at each iteration. The main advantage of this technique is that the method can adjust the parameter automatically and the numbers of iteration are not very sensitive to different initial parameter _ρ0.${\rho }_0.$