On two-coefficient identification in elliptic variational inequalities

Abstract

This paper is concerned with elliptic variational inequalities that depend on two parameters. First, we investigate the dependence of the solution of the forward problem on these parameters and prove a Lipschitz estimate. Then, we study the inverse problem of identification of these two parameters and formulate two optimization approaches to this parameter identification problem. We extend the output least-squares approach, provide an existence result and establish a convergence result for finite-dimensional approximation. Further, we investigate the modified output least-squares approach which is based on energy functionals. This latter approach can be related to vector approximation.     

Contingent derivatives and regularization for noncoercive inverse problems

Abstract

We study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results.     

Regularization of quasi-variational inequalities

An ill-posed quasi-variational inequality with contaminated data can be stabilized by employing the elliptic regularization. Under suitable conditions, a sequence of bounded regularized solutions converges strongly to a solution of the original quasi-variational inequality. Moreover, the conditions that ensure the boundedness of regularized solutions, become sufficient solvability conditions. It turns out that the regularization theory is quite strong for quasi-variational inequalities with set-valued monotone maps but restrictive for generalized pseudo-monotone maps. The results are quite general and are applicable to ill-posed variational inequalities, hemi-variational inequalities, inverse problems, and split feasibility problem, among others.     

Existence of solutions for variational inequalities on Riemannian manifolds

We establish the existence and uniqueness results for variational inequality problems on Riemannian manifolds and solve completely the open problem proposed in [S.Z. Németh, Variational inequalities on Hadamard manifolds, Nonlinear Anal. 52 (2003) 1491–1498]. Also the relationships between the constrained optimization problem and the variational inequality problems as well as the projections on Riemannian manifolds are studied.     

Inverse problems for quasi-variational inequalities

In this short note, our aim is to investigate the inverse problem of parameter identification in quasi-variational inequalities. We develop an abstract nonsmooth regularization approach that subsumes the total variation regularization and permits the identification of discontinuous parameters. We study the inverse problem in an optimization setting using the output-least squares formulation. We prove the existence of a global minimizer and give convergence results for the considered optimization problem. We also discretize the identification problem for quasi-variational inequalities and provide the convergence analysis for the discrete problem. We give an application to the gradient obstacle problem.     

Projection-proximal methods for general variational inequalities

In this paper, we consider and analyze some new projection-proximal methods for solving general variational inequalities. The modified methods converge for pseudomonotone operators which is a weaker condition than monotonicity. The proposed methods include several new and known methods as special cases. Our results can be considered as a novel and important extension of the previously known results. Since the general variational inequalities include the quasi-variational inequalities and implicit complementarity problems as special cases, results proved in this paper continue to hold for these problems.     

Lexicographic variational inequalities with applications

In this article, we consider equivalence properties between various kinds of lexicographic variational inequalities. By employing various concepts of monotonicity, we show that the usual sequential variational inequality is equivalent to the direct lexicographic variational inequality or to the dual lexicographic variational inequality. We establish several existence results for lexicographic variational inequalities. Also, we introduce the lexicographic complementarity problem and establish its equivalence with the lexicographic variational inequality. We illustrate our approach by several examples of applications to vector transportation and vector spatial equilibrium problems.     

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.     

Set-valued mixed quasi-variational inequalities and implicit resolvent equations

In this paper, we introduce and study a new class of variational inequalities, which is called the set-valued mixed quasi-variational inequality. The resolvent operator technique is used to establish the equivalence among generalized set-valued mixed quasi-variational inequalities, fixed-point problems and the set-valued implicit resolvent equations. This equivalence is used to study the existence of a solution of set-valued variational inequalities and to suggest a number of iterative algorithms for solving variational inequalities and related optimization problems. The results proved in this paper represent a significant refinement and improvement of the previously known results in this area.     

Generalized solutions of quasi variational inequalities

This paper deals with multivalued quasi variational inequalities with pseudo-monotone and monotone maps. The primary objective of this work is to show that the notion of generalized solutions can be employed to investigate multivalued pseudo-monotone quasi variational inequalities. It is a well-known fact that a quasi variational inequality can conveniently be posed as a fixed point problem through the so-called variational selection. For pseudo-monotone maps, the associated variational selection is a nonconvex map, and the fixed point theorems can only be applied under restrictive assumptions on the data of quasi variational inequalities. On the other hand, the generalized solutions are defined by posing a minimization problem which can be solved by a variant of classical Weierstrass theorem. It turns out that far less restrictive assumptions on the data are needed in this case. To emphasis on the strong difference between a classical solution and a generalized solution, we also give a new existence theorem for quasi variational inequalities with monotone maps. The main existence result is proved under a milder coercivity condition. We also relax a few other conditions from the monotone map. Due to its flexibility, it seems that the notion of generalized solutions can be employed to study quasi variational inequalities for other classes of maps as well.     

Vector variational inequalities and vector optimization problems on Hadamard manifolds

In this paper, we introduce a Minty type vector variational inequality, a Stampacchia type vector variational inequality, and the weak forms of them, which are all defined by means of subdifferentials on Hadamard manifolds. We also study the equivalent relations between the vector variational inequalities and nonsmooth convex vector optimization problems. By using the equivalent relations and an analogous to KKM lemma, we give some existence theorems for weakly efficient solutions of convex vector optimization problems under relaxed compact assumptions.     

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.     

Existence results for Stampacchia and Minty type vector variational inequalities

In this article, we consider the general forms of Stampacchia and Minty type vector variational inequalities for bifunctions and establish the existence of their solutions in the setting of topological vector spaces. We extend these vector variational inequalities for set-valued maps and prove the existence of their solutions in the setting of Banach spaces as well as topological vector spaces. We point out that our vector variational inequalities extend and generalize several vector variational inequalities that appeared in the literature. As applications, we establish some existence results for a solution of the vector optimization problem by using Stampacchia and Minty type vector variational inequalities.     

Iterative methods for solving general quasi-variational inequalities

In this paper, we introduce a new class of variational inequalities, which is called the general quasi-variational inequality. We establish the equivalence among the general quasi variational inequality and implicit fixed point problems and the Wiener–Hopf equations. We use this equivalent formulation to discuss the existence of a solution of the general quasi-variational inequality. This equivalent formulation is used to suggest and analyze some iterative algorithms for solving the general quasi-variational inequality. We also discuss the convergence analysis of these iterative methods. Several special cases are also discussed.     

Dynamical systems and variational inequalities

The variational inequality problem has been utilized to formulate and study a plethora of competitive equilibrium problems in different disciplines, ranging from oligopolistic market equilibrium problems to traffic network equilibrium problems. In this paper we consider for a given variational inequality a naturally related ordinary differential equation. The ordinary differential equations that arise are nonstandard because of discontinuities that appear in the dynamics. These discontinuities are due to the constraints associated with the feasible region of the variational inequality problem. The goals of the paper are two-fold. The first goal is to demonstrate that although non-standard, many of the important quantitative and qualitative properties of ordinary differential equations that hold under the standard conditions, such as Lipschitz continuity type conditions, apply here as well. This is important from the point of view of modeling, since it suggests (at least under some appropriate conditions) that these ordinary differential equations may serve as dynamical models. The second goal is to prove convergence for a class of numerical schemes designed to approximate solutions to a given variational inequality. This is done by exploiting the equivalence between the stationary points of the associated ordinary differential equation and the solutions of the variational inequality problem. It can be expected that the techniques described in this paper will be useful for more elaborate dynamical models, such as stochastic models, and that the connection between such dynamical models and the solutions to the variational inequalities will provide a deeper understanding of equilibrium problems.     

On system of generalized vector variational inequalities

In this paper, we introduce a new system of generalized vector variational inequalities with variable preference. This extends the model of system of generalized variational inequalities due to Pang and Konnov independently as well as system of vector equilibrium problems due to Ansari, Schaible and Yao. We establish existence of solutions to the new system under weaker conditions that include a new partial diagonally convexity and a weaker notion than continuity. As applications, we derive existence results for both systems of vector variational-like inequalities and vector optimization problems with variable preference.     

Solution differentiability for variational inequalities

In this paper we study solution differentiability properties for variational inequalities. We characterize Fréchet differentiability of perturbed solutions to parametric variational inequality problems defined on polyhedral sets. Our result extends the recent result of Pang and it directly specializes to nonlinear complementarity problems, variational inequality problems defined on perturbed sets and to nonlinear programming problems.     

General algorithm for variational inequalities

In this paper, we consider a general auxiliary principle technique to suggest and analyze a novel and innovative iterative algorithm for solving variational inequalities and optimization problems. We also discuss the convergence criteria.     

Projection iterative methods for solving some systems of general nonconvex variational inequalities

In this article, we introduce and consider a new system of general nonconvex variational inequalities involving four different operators. We use the projection operator technique to establish the equivalence between the system of general nonconvex variational inequalities and the fixed points problem. This alternative equivalent formulation is used to suggest and analyse some new explicit iterative methods for this system of nonconvex 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 nonconvex variational inequalities, variational inequalities and related optimization problems as special cases, results obtained in this article continue to hold for these problems. Our results can be viewed as a refinement and an improvement of the previously known results for variational 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.