The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild conditions. Secondly, a classification of polynomial variational inequalities based on dimensions of their solution sets is introduced and investigated. Several illustrative examples are provided.
We study nested variational inequalities, which are variational inequalities whose feasible set is the solution set of another variational inequality. We present a projected averaging Tikhonov algorithm requiring the weakest conditions in the literature to guarantee the convergence to solutions of the nested variational inequality. Specifically, we only need monotonicity of the upper- and the lower-level variational inequalities. Also, we provide the first complexity analysis for nested variational inequalities considering optimality of both the upper- and lower-level.
An adaptive proximal method for a special class of variational inequalities and related problems is proposed. For example, the so-called mixed variational inequalities and composite saddle problems are considered. Some estimates of the necessary number of iterations are obtained to achieve a given quality of the solution.
An adaptive analogue of the Yu. E. Nesterov method for variational inequalities with a strongly monotone operator is proposed. Some estimates are obtained for the parameters determining the quality of the solution of the variational inequality depending on the number of iterations.
Basing on some recently proposed methods for solving variational inequalities with non-smooth operators, we propose an analogue of the Mirror Prox method for the corresponding class of problems under the assumption of relative smoothness and relative strong monotonicity of the operator.
An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational inequalities whose domains are bounded or unbounded convex bodies.
We introduce new types of systems of generalized quasi-variational inequalities and we prove the existence of the solutions by using results of pair equilibrium existence for free abstract economies. We consider the fuzzy models and we also introduce the random free abstract economy and the random equilibrium pair. The existence of the solutions for the systems of quasi-variational inequalities comes as consequences of the existence of equilibrium pairs for the considered free abstract economies.
A new adaptive approach is proposed for variational inequalities with a Lipschitz-continuous field. Estimates of the necessary number of iterations are obtained to achieve a given quality of the variational inequality solution. A generalization of the method under consideration to the case of a Holder-continuous field is considered.
It is known that for convex sets, the KKM condition is equivalent to the finite intersection property. We use this equivalence to obtain a characterisation of monotone operators in terms of convex KKM maps and in terms of the existence of solutions to Minty variational inequalities. The latter result provides a converse to the seminal theorem of Minty.
In this paper we present some new results on the existence of solutions of generalized variational inequalities in real reflexive Banach spaces with Fréchet differentiable norms. Moreover, we also give some theorems about the structure of solution sets. The results obtained in this paper improve and extend the ones announced by Fang and Peterson [1] to infinite dimensional spaces.
In this paper, we introduce a Bayesian abstract fuzzy economy model and we prove the Bayesian fuzzy equilibrium existence. As applications, we prove the existence of the solutions for two types of random quasi-variational inequalities with random fuzzy mappings and we also obtain random fixed point theorems.
We study necessary and sufficient conditions to attain solutions of set-optimization problems in therms of variational inequalities of Stampacchia and Minty type. The notion of a solution we deal with has been introduced Heyde and Loehne, for convex set-valued objective functions. To define the set-valued variational inequality, we introduce a set-valued directional derivative and we relate it to the Dini derivatives of a family of linearly scalarized problems. The optimality conditions are given by Stampacchia and Minty type Variational inequalities, defined both by the set valued directional…
The paper starts with a concise description of the recently developed semismooth* Newton method for the solution of general inclusions. This method is then applied to a class of variational inequalities of the second kind. As a result, one obtains an implementable algorithm exhibiting a local superlinear convergence. Thereafter we suggest several globally convergent hybrid algorithms in which one combines the semismooth* Newton method with selected splitting algorithms for the solution of monotone variational inequalities. Their efficiency is documented by extensive numerical experiments.
This paper is devoted to present new error bounds of regularized gap functions for polynomial variational inequalities with exponents explicitly determined by the dimension of the underlying space and the number/degree of the involved polynomials. The developed techniques are largely based on variational analysis and semialgebraic geometry, which allow us to establish a nonsmooth extension of the seminal Łojasiewicz's gradient inequality to regularized gap functions with explicitly calculated exponents.
We introduce the notion of weak minimizer in set optimization. Necessary and sufficient conditions in terms of scalarized variational inequalities of Stampacchia and Minty type, respectively, are proved. As an application, we obtain necessary and sufficient optimality conditions for weak efficiency of vector optimization in infinite dimensional spaces. A Minty variational principle in this framework is proved as a corollary of our main result.
In this paper, we introduce an abstract fuzzy economy model with a measure space of agents which generalizes Patriche's model (2009), we obtain a theorem of fuzzy equilibrium existence and we prove the existence of the solutions for two types of random quasi-variational inequalities with random fuzzy mappings. As a consequence, we obtain random fixed point theorems.
In this paper we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems and variational inequalities. This framework allows to obtain many known methods as a special case, the list including accelerated gradient method, composite optimization methods, level-set methods, proximal methods. The idea of the framework is based on constructing an inexact model of the main problem component, i.e. objective function in optimization or operator in variational inequalities. Besides reproducing known results…
The article is devoted to the development of numerical methods for solving variational inequalities with relatively strongly monotone operators. We consider two classes of variational inequalities related to some analogs of the Lipschitz condition of the operator that appeared several years ago. One of these classes is associated with the relative boundedness of the operator, and the other one with the analog of the Lipschitz condition (namely, relative smoothness). For variational inequalities with relatively bounded and relatively strongly monotone operators, we introduce a modification of t…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone mappings and the set of fixed points of a finite family of nonexpansive mappings in Hilbert space. Strong convergence theorem is proved for the sequence generated by the scheme. Finally, a parallel iterative algorithm for two finite families of variational inequalities and nonexpansive mappings is established.
The regularity theory for variational inequalities over polyhedral sets developed in a series of papers by Robinson, Ralph and Dontchev-Rockafellar in the 90s has long become classics of variational analysis. But in the available proofs of almost all main results, fairly nontrivial as they are, techniques of variational analysis do not play a significant part. In the paper we develop a new approach that allows to obtain some generalizations of the the mentioned results without invoking anything beyond elementary geometry of convex polyhedra and some basic facts of the theory of metric regulari…
Weak convergence of inertial iterative method for solving variational inequalities is the focus of this paper. The cost function is assumed to be non-Lipschitz and monotone. We propose a projection-type method with inertial terms and give weak convergence analysis under appropriate conditions. Some test results are performed and compared with relevant methods in the literature to show the efficiency and advantages given by our proposed methods.
We present a new Progressive Hedging Algorithm to solve Stochastic Variational Inequalities in the formulation introduced by Rockafellar and Wets in 2017, allowing the generated subproblems to be approximately solved with an implementable tolerance condition. Our scheme is based on Inexact Proximal Point methods and generalizes the exact algorithm developed by Rockafellar and Sun in 2019, providing stronger convergence results. We also show some numerical experiments in two-stage Nash games.
In this paper, we introduce two novel parallel projection methods for finding a solution of a system of variational inequalities which is also a common fixed point of a family of (asymptotically) $κ$ - strict pseudocontractive mappings. A technical extension in the proposed algorithms helps in computing practical numerical experiments when the number of subproblems is large. Some numerical examples are implemented to demonstrate the efficiency of parallel computations.
The paper starts with a description of the SCD (subspace containing derivative) mappings and the SCD semismooth* Newton method for the solution of general inclusions. This method is then applied to a class of variational inequalities of the second kind. As a result, one obtains an implementable algorithm exhibiting a locally superlinear convergence. Thereafter we suggest several globally convergent hybrid algorithms in which one combines the SCD semismooth* Newton method with selected splitting algorithms for the solution of monotone variational inequalities. Finally we demonstrate the efficie…
In the literature, necessary and sufficient conditions in terms of variational inequalities are introduced to characterize minimizers of convex set valued functions with values in a conlinear space. Similar results are proved for a weaker concept of minimizers and weaker variational inequalities. The implications are proved using scalarization techniques that eventually provide original problems, not fully equivalent to the set-valued counterparts. Therefore, we try, in the course of this note, to close the network among the various notions proposed. More specifically, we prove that a minimize…
Tseng's forward-backward-forward algorithm is a valuable alternative for Korpelevich's extragradient method when solving variational inequalities over a convex and closed set governed by monotone and Lipschitz continuous operators, as it requires in every step only one projection operation. However, it is well-known that Korpelevich's method converges and can therefore be used also for solving variational inequalities governed by pseudo-monotone and Lipschitz continuous operators. In this paper, we first associate to a pseudo-monotone variational inequality a forward-backward-forward dynamical…
In this paper, we investigate several properties of the solution maps of variational inequalities with polynomial data. First, we prove some facts on the $R_0$-property, the local boundedness, and the upper semicontinuity of the solution maps. Second, we establish results on the solution existence and the local upper-Hölder stability under the copositivity condition. Third, when the constraint set is semi-algebraic, we discuss the genericity of the $R_0$-property and the finite-valuedness of the solution maps.
In this paper, we generalize the classical extragradient algorithm for solving variational inequality problems by utilizing nonzero normal vectors of the feasible set. In particular, conceptual algorithms are proposed with two different linesearchs. We then establish convergence results for these algorithms under mild assumptions. Our study suggests that nonzero normal vectors may significantly improve convergence if chosen appropriately.
In this paper, we investigate optimal control problems governed by semilinear elliptic variational inequalities involving constraints on the state, and more precisely the obstacle problem. Since we adopt a numerical point of view, we first relax the feasible domain of the problem, then using both mathematical programming methods and penalization methods we get optimality conditions with smooth Lagrange multipliers. Some numerical experiments using IPOPT algorithm are presented to verify the efficiency of our approach.
Solutions of a variational inequality are found by giving conditions for the monotone convergence with respect to a cone of the Picard iteration corresponding to its natural map. One of these conditions is the isotonicity of the projection onto the closed convex set in the definition of the variational inequality. If the closed convex set is a cylinder and the cone is an extented Lorentz cone, then this condition can be dropped because it is automatically satisfied. The obtained result is further particularized for unbounded box constrained variational inequalities. For this case a numerical e…
In this paper, what we concern about is the weakly homogeneous variational inequality over a finite dimensional real Hilbert space. We achieve an existence result {under} copositivity of leading term of the involved map, norm-coercivity of the natural map and several additional conditions. These conditions we used are easier to check and cross each other with those utilized in the main result established by Gowda and Sossa (Math Program 177:149-171, 2019). As a corollary, we obtain a result on the solvability of nonlinear equations with weakly homogeneous maps involved. Our result enriches the…
In this paper, we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems, and variational inequalities. This framework allows obtaining many known methods as a special case, the list including accelerated gradient method, composite optimization methods, level-set methods, Bregman proximal methods. The idea of the framework is based on constructing an inexact model of the main problem component, i.e. objective function in optimization or operator in variational inequalities. Besides reproducing kno…
Some adaptive analogue of the Mirror Prox method for variational inequalities is proposed. In this work we consider the adaptation not only to the value of the Lipschitz constant, but also to the magnitude of the oracle error. This approach, in particular, allows us to prove a complexity near $O\left(\frac{1}{\varepsilon}\log_2\frac{1}{\varepsilon}\right)$ for variational inequalities for a special class of monotone bounded operators. This estimate is optimal for variational inequalities with monotone Lipschitz-continuous operators. However, there exists some error, which may be insignificant.…
In this paper an inexact proximal point method for variational inequalities in Hadamard manifolds is introduced and studied its convergence properties. The main tool used for presenting the method is the concept of enlargement of monotone vector fields, which generalizes the concept of enlargement of monotone operators from the linear setting to the Riemannian context. As an application, an inexact proximal point method for constrained optimization problems is obtained.
In this paper, we introduce an abstract fuzzy economy (generalized fuzzy game) model with a countable space of actions and we study the existence of the fuzzy equilibrium. As applications, two types of results are obtained. The first ones concern the existence of the solutions for systems of generalized quasi-variational inequalities with random fuzzy mappings which we define. The last ones are new random fixed point theorems for correspondences with values in complete countable metric spaces.
This paper continues earlier work and is concerned with the inverse problem of parameter identification in variational inequalities of the second kind that does not only treat the parameter linked to a bilinear form, but importantly also the parameter linked to a nonlinear non-smooth function. The optimization approach in the earlier work on the inverse problem using the output-least squares formulation involves the variational inequality of the second kind as constraint. Here we use regularization technics of nondifferentiable optimization, regularize the nonsmooth part in the variational ine…
We consider a quasi-variational inequality governed by a moving set. We employ the assumption that the movement of the set has a small Lipschitz constant. Under this requirement, we show that the quasi-variational inequality has a unique solution which depends Lipschitz-continuously on the source term. If the data of the problem is (directionally) differentiable, the solution map is directionally differentiable as well. We also study the optimal control of the quasi-variational inequality and provide necessary optimality conditions of strongly stationary type.
In this paper, we introduce a class of variational inequalities, where the involved function is the sum of an arbitrary given vector and a homogeneous polynomial defined by a tensor; and we call it the tensor variational inequality (TVI). The TVI is a natural extension of the affine variational inequality and the tensor complementarity problem. We show that a class of multi-person noncooperative games can be formulated as a TVI. In particular, we investigate the global uniqueness and solvability of the TVI. To this end, we first introduce two classes of structured tensors and discuss some rela…
In this paper, we consider interval-valued vector optimization problems $(IVOP)$ and derive their relationships to interval vector variational inequalities $(IVVI)$ of Minty and Stampacchia type in terms of convexificators and LU-efficient solution of $(IVOP)$ using LU-convexity assumption. Furthermore, we consider weak versions of $(IVVI)$ of Minty and Stampacchia type and find the relationships between weak versions of $(IVVI)$ of Minty and Stampacchia type and weakly LU-efficient solution of $(IVOP)$. The results presented in this paper extend and generalized some existing results in the li…
In this paper, we introduce an inertial Tseng's extragradient method for solving multi-valued variational inequalits, in which only one projection is needed at each iterate. We also obtain the strong convergence results of the proposed algorithm, provided that the multi-valued mapping is continuous and pseudomonotone with nonempty compact convex values. Moreover, numerical simulation results illustrate the efficiency of our method when compared to existing methods.
We investigate optimality conditions for optimization problems constrained by a class of variational inequalities of the second kind. Based on a nonsmooth primal-dual reformulation of the governing inequality, the differentiability of the solution map is studied. Directional differentiability is proved both for finite-dimensional and function space problems, under suitable assumptions on the active set. A characterization of B- and strong stationary optimal solutions is obtained thereafter. Finally, based on the obtained first-order information, a trust-region algorithm is proposed for the sol…
Stochastic variational inequalities (SVI) model a large class of equilibrium problems subject to data uncertainty, and are closely related to stochastic optimization problems. The SVI solution is usually estimated by a solution to a sample average approximation (SAA) problem. This paper considers the normal map formulation of an SVI, and proposes a method to build asymptotically exact confidence regions and confidence intervals for the solution of the normal map formulation, based on the asymptotic distribution of SAA solutions. The confidence regions are single ellipsoids with high probabilit…
In this paper we propose two strongly convergent parallel hybrid iterative methods for finding a common element of the set of fixed points of a family of quasi $ϕ$-asymptotically nonexpansive mappings $\{F(S_j)\}_{j=1}^N$, the set of solutions of variational inequalities $\{VI(A_i,C)\}_{i=1}^M$ and the set of solutions of equilibrium problems $\{EP(f_k)\}_{k=1}^K$ in uniformly smooth and 2-uniformly convex Banach spaces. A numerical experiment is given to verify the efficiency of the proposed parallel algorithms.
