Inverse problems for multi-valued quasi variational inequalities and noncoercive variational inequalities with noisy data

ABSTRACT

We study the inverse problem of identifying a variable parameter in variational and quasi-variational inequalities. We consider a quasi-variational inequality involving a multi-valued monotone map and give a new existence result. We then formulate the inverse problem as an optimization problem and prove its solvability. We also conduct a thorough study of the inverse problem of parameter identification in noncoercive variational inequalities which appear commonly in applied models. We study the inverse problem by posing optimization problems using the output least-squares and the modified output least-squares. Using regularization, penalization, and smoothing, we obtain a single-valued parameter-to-selection map and study its differentiability. We consider optimization problems using the output least-squares and the modified output least-squares for the regularized, penalized and smoothened variational inequality. We give existence results, convergence analysis, and optimality conditions. We provide applications and numerical examples to justify the proposed framework.     

Weighted variational inequalities in normed spaces

In this article, we consider weighted variational inequalities over a product of sets and a system of weighted variational inequalities in normed spaces. We extend most results established in Ansari, Q.H., Khan, Z. and Siddiqi, A.H., (Weighted variational inequalities, Journal of Optimization Theory and Applications, 127(2005), pp. 263–283), from Euclidean spaces ordered by their respective non-negative orthants to normed spaces ordered by their respective non-trivial closed convex cones with non-empty interiors.     

Sensitivity analysis for variational inequalities

Sensitivity analysis results for variational inequalities are presented which give conditions for existence and equations for calculating the derivatives of solution variables with respect to perturbation parameters. The perturbations are of both the variational inequality function and the feasible region. Results for the special case of nonlinear complementarity are also presented. A numerical example demonstrates the results for variational inequalities.The author is indebted to A. V. Fiacco for many valuable suggestions and comments. This work was supported in part by funding from the Economic Regulatory Administration, US Department of Energy, under Contract No. W31109ENG38.     

A network formulation of market equilibrium problems and variational inequalities

This paper shows that market equilibrium problems of production may generally be modelled as equilibrium flow problems in networks and that their equilibrium conditions can be visualized as a variational inequality. This connection would allow us to transplant directly elements of the well-developed theory of equilibrium flow in networks to the theory of market equilibrium.     

Interior-point algorithms for monotone affine variational inequalities

Given ann×n matrixM, a vectorq in ⁿ , a polyhedral convex setX={x|Axb, Bx=d}, whereA is anm×n matrix andB is ap×n matrix, the affinne variational inequality problem is to findxX such that (Mx+q) ^T (y–x)0 for allyX. IfM is positive semidefinite (not necessarily symmetric), the affine variational inequality can be transformeo to a generalized complementarity problem, which can be solved in polynomial time using interior-point algorithms due to Kojima et al. We develop interior-point algorithms that exploit the particular structure of the problem, rather than direictly reducing the problem to a standard linear complemntarity problem.This work was partially supported by the Air Force Office of Scientific Research, Grant AFOSR-89-0410 and the National Science Foundation, Grant CCR-91-57632.The authors acknowledge Professor Osman Güler for pointing out the valoidity of Theorem 2.1 without further assumptions and the proof to that effect. They are also grateful for his comments to improve the presentation of this paper.     

A reduction method for variational inequalities

This paper explains a method by which the number of variables in a variational inequality having a certain form can be substantially reduced by changing the set over which the variational inequality is posed. The method applies in particular to certain economic equilibrium problems occurring in applications. We explain and justify the method, and give examples of its application, including a numerical example in which the solution time for the reduced problem was approximately 2% of that for the problem in its original form. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.The research reported here was sponsored by the Air Force Office of Scientific Research, Air Force Materiel Command, USAF, under grant number F49620-95-1-0222, and by the U.S. Army Research Office under grant number DAAH04-95-1-0149. The U.S. Government has certain rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conclusions contained herein are those of the author and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the sponsoring agencies or the U.S. Government.     

Singular perturbations for variational inequalities with time-dependent constraints

We study an abstract hyperbolic variational inequality with a (small) parameter and with time-dependent subdifferentials in a real Hilbert space. We prove that its solution converges to a solution of a parabolic variational inequality as the parameter tends to zero. We also explain how to apply the abstract theory to concrete unilateral problems.     

Formulation,Stability, and Computation of Traffic Network Equilibria as Projected Dynamical Systems

In this paper, we present a unified treatment and analysis of a dynamic traffic network model with elastic demands formulated and studied as a projected dynamical system. We propose a travel route choice adjustment process that satisfies the projected dynamical system. Under certain conditions, stability and asymptotical stability of the equilibrium patterns are then derived. Finally, two discrete-time algorithms, the Euler method and the Heun method, are proposed for the computation of the solutions, and convergence results established. The convergence results depend crucially on stability analysis. The performance of the algorithms is then illustrated on several transportation networks.     

Exchange price equilibria and variational inequalities

The aim of this paper is to show the relevance of the concept and the theory of variational inequalities in the study of economic equilibria.Supported by the National Science Foundation grant DMS-8601778.     

System of nonsmooth variational inequalities with applications

In this paper, we consider a system of vector variational inequalities and a system of nonsmooth variational inequalities defined by means of Clarke directional derivative. We also consider the Nash equilibrium problem with vector pay-offs and its scalarized form. We present some relations among these systems and problems. The existence results for a solution of system of nonsmooth variational inequalities are given. As a consequence, we derive an existence result for a solution of Nash equilibrium problem with vector pay-offs.     

A class of implicit variational inequalities and applications to frictional contact

This paper deals with the mathematical and numerical analysis of a class of abstract implicit evolution variational inequalities. The results obtained here can be applied to a large variety of quasistatic contact problems in linear elasticity, including unilateral contact or normal compliance conditions with friction. In particular, a quasistatic unilateral contact problem with nonlocal friction is considered. An algorithm is derived and some numerical examples are presented. Copyright © 2009 John Wiley & Sons, Ltd.     

Decomposition of generalized vector variational inequalities

A multicriteria optimization problem is called Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for at least one subproblem obtained from it by selecting certain criteria. The aim of this paper is to investigate a similar property within a special class of generalized vector variational inequalities, under appropriate generalized convexity assumptions.     

An additive Schwarz method for variational inequalities

This paper proposes an additive Schwarz method for variational inequalities and their approximations by finite element methods. The Schwarz domain decomposition method is proved to converge with a geometric rate depending on the decomposition of the domain. The result is based on an abstract framework of convergence analysis established for general variational inequalities in Hilbert spaces.

     

Modified descent-projection method for solving variational inequalities

In this paper, we propose a modified descent-projection method for solving variational inequalities. The method makes use of a descent direction to produce the new iterate and can be viewed as an improvement of the descent-projection method by using a new step size. Under certain conditions, the global convergence of the proposed method is proved. In order to demonstrate the efficiency of the proposed method, we provide numerical results for a traffic equilibrium problems.     

Iterative algorithms for systems of extended regularized nonconvex variational inequalities and fixed point problems

This paper points out some fatal errors in the equivalent formulations used in Noor 2011 [Noor MA. Projection iterative methods for solving some systems of general nonconvex variational inequalities. Applied Analysis. 2011;90:777–786] and consequently in Noor 2009 [Noor MA. System of nonconvex variational inequalities. Journal of Advanced Research Optimization. 2009;1:1–10], Noor 2010 [Noor MA, Noor KI. New system of general nonconvex variational inequalities. Applied Mathematics E-Notes. 2010;10:76–85] and Wen 2010 [Wen DJ. Projection methods for a generalized system of nonconvex variational inequalities with different nonlinear operators. Nonlinear Analysis. 2010;73:2292–2297]. Since these equivalent formulations are the main tools to suggest iterative algorithms and to establish the convergence results, the algorithms and results in the aforementioned articles are not valid. It is shown by given some examples. To overcome with the problems in these papers, we consider a new system of extended regularized nonconvex variational inequalities, and establish the existence and uniqueness result for a solution of the aforesaid system. We suggest and analyse a new projection iterative algorithm to compute the unique solution of the system of extended regularized nonconvex variational inequalities which is also a fixed point of a nearly uniformly Lipschitzian mapping. Furthermore, the convergence analysis of the proposed iterative algorithm under some suitable conditions is studied. As a consequence, we point out that one can derive the correct version of the algorithms and results presented in the above mentioned papers.     

Quasi‐subdifferential operator approach to elliptic variational and quasi‐variational inequalities

We prove an existence theorem for an abstract operator equation associated with a quasi‐subdifferential operator and then apply it to concrete elliptic variational and quasi‐variational inequalities. Copyright © 2016 John Wiley & Sons, Ltd.     

Existence results for systems of strong implicit vector variational inequalities

The purpose of this paper is to introduce and study systems of strong implicit vector variational inequalities. Under suitable conditions, some existence results for systems of strong implicit vector variational inequalities are established by the Kakutani--Fan--Glicksberg fixed point theorem. This revised version was published online in June 2006 with corrections to the Cover Date.     

Generalized convex functions and vector variational inequalities

In this paper, (, ,Q)-invexity is introduced, where :X ×X intR _m ⁺ , :X ×X X,X is a Banach space,Q is a convex cone ofR ^m . This unifies the properties of many classes of functions, such asQ-convexity, pseudo-linearity, representation condition, null space condition, andV-invexity. A generalized vector variational inequality is considered, and its equivalence with a multi-objective programming problem is discussed using (, ,Q)-invexity. An existence theorem for the solution of a generalized vector variational inequality is proved. Some applications of (, ,Q)-invexity to multi-objective programming problems and to a special kind of generalized vector variational inequality are given.The author is indebted to Dr. V. Jeyakumar for his constant encouragement and useful discussion and to Professor P. L. Yu for encouragement and valuable comments about this paper.