Pseudomonotone variational inequality problems: Existence of solutions

Necessary and sufficient conditions for the set of solutions of a pseudomonotone variational inequality problem to be nonempty and compact are given. This research was partially done while the author was visiting the University of Chile thanks to the support of an ECOS program.     

A variational inequality formulation of equilibrium models for end-of-life products with nonlinear constraints

Variational inequality theory facilitates the formulation of equilibrium problems in economic networks. Examples of successful applications include models of supply chains, financial networks, transportation networks, and electricity networks. Previous economic network equilibrium models that were formulated as variational inequalities only included linear constraints; in this case the equivalence between equilibrium problems and variational inequality problems is achieved with a standard procedure because of the linearity of the constraints. However, in reality, often nonlinear constraints can be observed in the context of economic networks. In this paper, we first highlight with an application from the context of reverse logistics why the introduction of nonlinear constraints is beneficial. We then show mathematical conditions, including a constraint qualification and convexity of the feasible set, which allow us to characterize the economic problem by using a variational inequality formulation. Then, we provide numerical examples that highlight the applicability of the model to real-world problems. The numerical examples provide specific insights related to the role of collection targets in achieving sustainability goals.     

A numerical approach to optimization problems with variational inequality constraints

Optimization problems with variational inequality constraints are converted to constrained minimization of a local Lipschitz function. To this minimization a non-differentiable optimization method is used; the required subgradients of the objective are computed by means of a special adjoint equation. Besides tests with some academic examples, the approach is applied to the computation of the Stackelberg—Cournot—Nash equilibria and to the numerical solution of a class of quasi-variational inequalities.Corresponding author.     

Existence and uniqueness of solutions of the generalized polynomial variational inequality

Optimization Letters - In this paper, we consider the generalized polynomial variational inequality, which is a subclass of generalized variational inequalities; and it covers several classes of...     

Existence of solutions of the parabolic variational inequality with variable exponent of nonlinearity

In this article, new properties of variable exponent Lebesgue and Sobolev spaces are examined. Using these properties we prove the existence of the solution of some parabolic variational inequality.     

Multiobjective optimization problem with variational inequality constraints

 We study a general multiobjective optimization problem with variational inequality, equality, inequality and abstract constraints. Fritz John type necessary optimality conditions involving Mordukhovich coderivatives are derived. They lead to Kuhn-Tucker type necessary optimality conditions under additional constraint qualifications including the calmness condition, the error bound constraint qualification, the no nonzero abnormal multiplier constraint qualification, the generalized Mangasarian-Fromovitz constraint qualification, the strong regularity constraint qualification and the linear constraint qualification. We then apply these results to the multiobjective optimization problem with complementarity constraints and the multiobjective bilevel programming problem. Received: November 2000 / Accepted: October 2001 Published online: December 19, 2002 Key Words. Multiobjective optimization – Variational inequality – Complementarity constraint – Constraint qualification – Bilevel programming problem – Preference – Utility function – Subdifferential calculus – Variational principle Research of this paper was supported by NSERC and a University of Victoria Internal Research Grant Research was supported by the National Science Foundation under grants DMS-9704203 and DMS-0102496 Mathematics Subject Classification (2000): Sub49K24, 90C29     

Existence of solutions for generalized variational inequality problems in Banach spaces

In this paper, we prove the existence of solutions of generalized variational inequality for upper semicontinuous multivalued mappings with compact contractible values over compact convex subsets in a reflexive Banach space with a Fréchet differentiable norm. Moreover, we give some conditions that guarantee the existence of solutions of generalized variational inequality for upper semicontinuous multivalued mappings with compact contractible values over unbounded closed convex subsets. The result obtained in this paper improves and extends the recent ones announced by Yu and Yang [J. Yu, H. Yang, Existence of solutions for generalized variational inequality problems, Nonlinear Anal., 71 (2009) e2327-e2330] and many others.     

Parabolic variational inequality with parameter and gradient constraints

This paper concerns a singular control problem whose value function is governed by a time-dependent HJB equation with gradient constraints. The method is to transform a two-dimensional parabolic variational inequality with gradient constraints into a double obstacle problem with parameter involving two free boundaries that correspond to the investment and disinvestment policies. Moreover we analyze the behaviors of the free boundary surfaces. The main difficulties are to show the free boundary surfaces to be smooth with respect to time and to find the properties of free boundaries with respect to parameter.     

Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints

In this paper, we establish a nonlinear Lagrangian algorithm for nonlinear programming problems with inequality constraints. Under some assumptions, it is proved that the sequence of points, generated by solving an unconstrained programming, convergents locally to a Kuhn-Tucker point of the primal nonlinear programming problem.     

Existence theorems of solution to variational inequality problems

This paper introduces a new concept of exceptional family for variational inequality problems with a general convex constrained set. By using this new concept, the authors establish a general sufficient condition for the existence of a solution to the problem. This condition is weaker than many known solution conditions and it is also necessary for pseudomonotone variational inequalities. Suffi-cient solution conditions for a class of nonlinear complementarity problems with Po mappings are also obtained.     

Existence of solutions to a nonlinear boundary value problem by variational means

When material in a bounded region is undergoing an exothermic reaction, the temperature, under the assumption of a steady state, satisfies a nonlinear elliptic boundary value problem which can be ill posed. In this article the existence of generalised and classical solutions of these mildly nonlinear elliptic boundary value problems is shown by using variational methods. The work is motivated by, and generalises, the results given in Levinson (J. Math. Mech12 (1963), 567–575; Arch. Rational Mech. Anal.11 (1962), 258–272) for special cases of these equations in two dimensions.     

Differential variational inequality approach to dynamic games with shared constraints

The dynamic Nash equilibrium problem with shared constraints (NEPSC) involves a dynamic decision process with multiple players, where not only the players’ cost functionals but also their admissible control sets depend on the rivals’ decision variables through shared constraints. For a class of the dynamic NEPSC, we propose a differential variational inequality formulation. Using this formulation, we show the existence of solutions of the dynamic NEPSC, and develop a regularized smoothing method to find a solution of it. We prove that the regularized smoothing method converges to the least norm solution of the differential variational inequality, which is a solution of the dynamic NEPSC as the regularization parameter \(\lambda \) and smoothing parameter \(\mu \) go to zero with the order \(\mu =o(\lambda )\) . Numerical examples are given to illustrate the existence and convergence results.     

An algorithm for computing solutions of variational problems with global convexity constraints

We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivation behind the numerical method is to compute solutions to Adverse Selection problems within a Principal-Agent framework. Problems such as product lines design, optimal taxation, structured derivatives design, etc. can be studied through the scope of these models. We develop a method to estimate their optimal pricing schedules.     

A projection subgradient method for solving optimization with variational inequality constraints

In this paper, we propose a projection subgradient method for solving some classical variational inequality problem over the set of solutions of mixed variational inequalities. Under the conditions that $T$ is a $\Theta $ -pseudomonotone mapping and $A$ is a $\rho $ -strongly pseudomonotone mapping, we prove the convergence of the algorithm constructed by projection subgradient method. Our algorithm can be applied for instance to some mathematical programs with complementarity constraints.     

Existence of solutions for a vector variational inequality: An extension of the Hartmann-Stampacchia theorem

A vector variational inequality is studied. The paper deals with existence theorems for solutions under convexity assumptions and without convexity assumptions.This research was partially supported by the Italian Research Council (CNR), Group for Functional Analysis and Applications (GNAFA), and was carried out while the author was Visiting Professor at the Department of Mathematics, University of Pisa, September–November, 1989.     

Existence of solutions of nonlinear degenerate systems of parabolic variational inequalities

Systems of degenerated parabolic inequalities with an operator of gradient type are investigated. A Galerkintype argument is applied to approximate these systems by a sequence of time dependent variational inequalities in finite-dimensional spaces. Bibliography:1 title. Dedicated to N. N. Uraltseva on her jubilee Published inZapiski Nauchnykh Seminarov POMI, Vol. 221, 1995, pp. 243–252. Translated by M. Fuchs.     

A simplicial algorithm for the nonlinear complementarity problem

A triangulation of the nonnegative orthant and a special labeling of the vertices lead to a combinatorial procedure for seeking solutions or approximate solutions to the nonlinear complementarity problem under coercive-like assumptions on the problem functions. Derivatives are not required. Convergence is proved, computational considerations are discussed, and some preliminary applications to convex programming and saddle point computation, along with numerical results, are presented.     

Existence theorem and algorithm for a general implicit variational inequality in Banach space

By using the generalized f-projection operator, the existence theorem of solutions for the general implicit variational inequality GIVI(T-ξ,K) is proved without assuming the monotonicity of operators in reflexive and smooth Banach space. An iterative algorithm for approximating solution of the general implicit variational inequality is suggested also, and the convergence for this iterative scheme is shown. These theorems extend the corresponding results of Wu and Huang [K.Q. Wu, N.J. Huang, Comput. Math. Appl. 54 (2007) 399–406], Wu and Huang [K.Q. Wu, N.J. Huang, Bull. Austral. Math. Soc. 73 (2006) 307–317], Zeng and Yao [L.C. Zeng, J.C. Yao, J. Optimiz. Theory Appl. 132 (2) (2007) 321–337] and Li [J. Li, J. Math. Anal. Appl. 306 (2005) 55–71].     

Approximate values for mathematical programs with variational inequality constraints

In general the infimal value of a mathematical program with variational inequality constraints (MPVI) is not stable under perturbations in the sense that the sequence of infimal values for the perturbed programs may not converge to the infimal value of the original problem even in presence of nice data. Thus, for these programs we consider different types of values which approximate the exact value from below or/and from above under or without perturbations.