Generalized Nash games represent an extension of Nash games in which strategy sets are coupled across players. The equilibrium conditions of such a game can be compactly stated as a quasivariational inequality (QVI), an extension of the variational inequality (VI). Harker [9] showed that under certain conditions on the maps defining the QVI, a solution to a related VI solves the QVI. This is a ...

Generalized second–order directional derivatives for nonsmooth real–valued functions are studied and their connections with second–order variational sets are investigated. A necessary second–order optimality condition for problems with inequality constraints is obtained.

We present some error bound results of generalized D-gap functions for nonsmooth and nonmonotone variational inequality (VI) problems. Application is given in providing a derivative-free descent method.

Abstract: The problem of robust dynamic pricing of an abstract commodity, whose inventory is specified at an initial time but never subsequently replenished, originally studied by Perakis and Sood (2006) in discrete time, is considered from the perspective of continuous time. We use a multiplicative demand function to model the uncertain demand, and develop a robust counterpart to replace the u...

We establish two global bounds measuring the distance from any vector to the solution set of the co-coercive variational inequality. To prove our results, we use the fact that the co-coercivity condition is sufficient for the (strong) monotonicity of (perturbed) fixed point and normal maps associated with variational inequalities.

In this paper, we combine the subgradient extragradient method with the Halpern method for finding a solution of a variational inequality involving a monotone Lipschitz mapping in Banach spaces. By using the generalized projection operator and the Lyapunov functional introduced by Alber, we prove a strong convergence theorem. We also consider the problem of finding a common element of the set o...

In this paper we introduce an iterative process for finding a common element of the set of common fixed points of a countable family of nonexpansive mappings and the set of solutions of the variational inequality problem for a monotone, Lipschitz continuous mapping. The iterative process is based on two known methods hybrid and extragradient. We obtain a strong convergence theorem for three seq...

We present two proximal algorithms for solving the mixed equilibrium problems. Under some simpler framework, the strong and weak convergence of the sequences defined by two general algorithms is respectively obtained. In particular, we deal with several iterative schemes in a united way and apply our algorithms for solving the classical equilibrium problem, the minimization problem, the classic...