On Gabay’s algorithms for mixed variational inequalities

Iterative numerical algorithms for variational inequalities are systematically constructed from fixed-point problem characterizations in terms of resolvent operators. The applied method is the one introduced by Gabay in [Ga], used here in the context of discrete variational inequalities, and with the emphasis on mixed finite element models. The algorithms apply to nonnecessarily potential problems, generalizing primal and mixed Uzawa and augmented Lagrangian-type algorithms. They are also identified with Euler and operator splitting methods for the time discretization of evolution first-order problems.     

Well-posedness for Optimization Problems with Constraints defined by Variational Inequalities having a unique solution

We introduce various notions of well-posedness for a family of variational inequalities and for an optimization problem with constraints defined by variational inequalities having a unique solution. Then, we give sufficient conditions for well-posedness of these problems and we present an application to an exact penalty method.     

Primal-dual subgradient methods for convex problems

In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primal-dual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem. Besides other advantages, this useful feature provides the methods with a reliable stopping criterion. The proposed schemes differ from the classical approaches (divergent series methods, mirror descent methods) by presence of two control sequences. The first sequence is responsible for aggregating the support functions in the dual space, and the second one establishes a dynamically updated scale between the primal and dual spaces. This additional flexibility allows to guarantee a boundedness of the sequence of primal test points even in the case of unbounded feasible set (however, we always assume the uniform boundedness of subgradients). We present the variants of subgradient schemes for nonsmooth convex minimization, minimax problems, saddle point problems, variational inequalities, and stochastic optimization. In all situations our methods are proved to be optimal from the view point of worst-case black-box lower complexity bounds.     

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.     

A class of gap functions for variational inequalities

Recently Auchmuty (1989) has introduced a new class of merit functions, or optimization formulations, for variational inequalities in finite-dimensional space. We develop and generalize Auchmuty's results, and relate his class of merit functions to other works done in this field. Especially, we investigate differentiability and convexity properties, and present characterizations of the set of solutions to variational inequalities. We then present new descent algorithms for variational inequalities within this framework, including approximate solutions of the direction finding and line search problems. The new class of merit functions include the primal and dual gap functions, introduced by Zuhovickii et al. (1969a, 1969b), and the differentiable merit function recently presented by Fukushima (1992); also, the descent algorithm proposed by Fukushima is a special case from the class of descent methods developed in this paper. Through a generalization of Auchmuty's class of merit functions we extend those inherent in the works of Dafermos (1983), Cohen (1988) and Wu et al. (1991); new algorithmic equivalence results, relating these algorithm classes to each other and to Auchmuty's framework, are also given.Corresponding author.     

Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities

Hemivariational inequalities can be considered as a generalization of variational inequalities. Their origin is in nonsmooth mechanics of solid, especially in nonmonotone contact problems. The solution of a hemivariational inequality proves to be a substationary point of some functional, and thus can be found by the nonsmooth and nonconvex optimization methods. We consider two type of bundle methods in order to solve hemivariational inequalities numerically: proximal bundle and bundle-Newton methods. Proximal bundle method is based on first order polyhedral approximation of the locally Lipschitz continuous objective function. To obtain better convergence rate bundle-Newton method contains also some second order information of the objective function in the form of approximate Hessian. Since the optimization problem arising in the hemivariational inequalities has a dominated quadratic part the second order method should be a good choice. The main question in the functioning of the methods is how remarkable is the advantage of the possible better convergence rate of bundle-Newton method when compared to the increased calculation demand.     

Weighted Variational Inequalities

In this paper, we introduce weighted variational inequalities over product of sets and system of weighted variational inequalities. It is noted that the weighted variational inequality problem over product of sets and the problem of system of weighted variational inequalities are equivalent. We give a relationship between system of weighted variational inequalities and systems of vector variational inequalities. We define several kinds of weighted monotonicities and establish several existence results for the solution of the above-mentioned problems under these weighted monotonicities. We introduce also the weighted generalized variational inequalities over product of sets, that is, weighted variational inequalities for multivalued maps and systems of weighted generalized variational inequalities. Extensions of weighted monotonicities for multivalued maps are also considered. The existence of a solution of weighted generalized variational inequalities over product of sets is also studied. The existence results for a solution of weighted generalized variational inequality problem give also the existence of solutions of systems of generalized vector variational inequalities. The first and third author express their thanks to the Department of Mathematical Sciences, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia for providing excellent research facilities. The authors are also grateful to the referees for comments and suggestions improving the final draft of this paper.     

Global Method for Monotone Variational Inequality Problems with Inequality Constraints

We consider optimization methods for monotone variational inequality problems with nonlinear inequality constraints. First, we study the mixed complementarity problem based on the original problem. Then, a merit function for the mixed complementarity problem is proposed, and some desirable properties of the merit function are obtained. Through the merit function, the original variational inequality problem is reformulated as simple bounded minimization. Under certain assumptions, we show that any stationary point of the optimization problem is a solution of the problem considered. Finally, we propose a descent method for the variational inequality problem and prove its global convergence.     

Vector complementarity and minimal element problems

In this paper, vector complementarity problems are introduced as weak versions of vector variational inequalities in ordered Banach spaces. New dual cones are introduced and proved to be closed. In the sense of efficient point, we prove that the minimal element problem is solvable if a vector variational inequality is solvable; we also prove that any solution of a strong vector variational inequality or positive vector complementarity problem is a solution of the minimal element problem.This work was done while the author was with the Chongqing Institute of Architecture and Engineering, Chongqing, P. R. China.     

Duality for implicit variational problems and numerical applications

The present paper deals with a dual characterization of the solutions of implicit variational problems. Some general results relating the solutions of the dual problem with those of the primal one are applied to variational and quasi-variational inequalities, Nash equilibria, saddle points and fixed points.

Finally a dual method for the numerical solutions of some quasi-variational inequalities is developed.     

Systems of generalized variational inequalities and their applications ∗

In this paper, we first introduce the system of generalized implicit variational inequalities and prove the existence of its solution. Then we derive existence results for systems of generalized variational and variational like inequalities and system of variational inequalities. As applications, we establish some existence results for a solution to the system of optimization problems which includes the Nash equilibrium problem as a special case     

Extended Projection Methods for Monotone Variational Inequalities

In this paper, we prove that each monotone variational inequality is equivalent to a two-mapping variational inequality problem. On the basis of this fact, a new class of iterative methods for the solution of nonlinear monotone variational inequality problems is presented. The global convergence of the proposed methods is established under the monotonicity assumption. The conditions concerning the implementability of the algorithms are also discussed. The proposed methods have a close relationship to the Douglas–Rachford operator splitting method for monotone variational inequalities.     

A preconditioned descent algorithm for variational inequalities of the second kind involving the <Emphasis Type="Italic">p</Emphasis>-Laplacian operator

This paper is concerned with the numerical solution of a class of variational inequalities of the second kind, involving the p-Laplacian operator. This kind of problems arise, for instance, in the mathematical modelling of non-Newtonian fluids. We study these problems by using a regularization approach, based on a Huber smoothing process. Well posedness of the regularized problems is proved, and convergence of the regularized solutions to the solution of the original problem is verified. We propose a preconditioned descent method for the numerical solution of these problems and analyze the convergence of this method in function spaces. The existence of admissible descent directions is established by variational methods and admissible steps are obtained by a backtracking algorithm which approximates the objective functional by polynomial models. Finally, several numerical experiments are carried out to show the efficiency of the methodology here introduced.     

Parametric Quintic-Spline Approach to the Solution of a System of Fourth-Order Boundary-Value Problems

In this paper, we use parametric quintic splines to derive some consistency relations which are then used to develop a numerical method for computing the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. It is known that a class of variational inequalities related to contact problems in elastostatics can be characterized by a sequence of variational inequations, which are solved using some numerical method. Numerical evidence is presented to show the applicability and superiority of the new method over other collocation, finite difference, and spline methods.     

Dual finite element analysis for some elliptic variational equations and inequalities

In some boundary-value problems the gradient or the cogradient of the solution is more important than the solution itself. Dual variational formulation of elliptic problems is utilized to define finiteelement approximations of the cogradient. A priori error estimates are presented for a class of second-order elliptic problems, including problems of elastostatics. If the boundary conditions are classical (i.e., of Dirichlet, Neumann. Newton, or mixed type), the primal and dual formulations are equivalent with variational equations, whereas the unilateral boundary conditions lead to variational inequalities. The paper has a surveyable character.     

An improved Goldstein's type method for a class of variant variational inequalities

This paper aims at presenting an improved Goldstein's type method for a class of variant variational inequalities. In particular, the iterate computed by an existing Goldstein's type method [He, A Goldstein's type projection method for a class of variant variational inequalities J. Comput. Math. 17(4) (1999) 425–434]. is used to construct a descent direction, and thus the new method generates the new iterate by searching the optimal step size along the descent direction. Some restrictions on the involving functions of the existing Goldstein's type methods are relaxed, while the global convergence of the new method is proved without additional assumptions. The computational superiority of the new method is verified by the comparison to some existing methods.     

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.     

Banach空间上变分不等式的一个超梯度方法

把王宜举等人[Modified extragradient—type method for variational inequali—ties and verification of the existence of solutions,J.Optim.Theory Appl.,2003,119:167-183]在欧氏空间上求解变分不等式的一个超梯度型方法推广到Banach空间.变分不等式中的算子不要求是一致连续的,其主要优点在于不管变分不等式是否有解,算法都是可执行的.此外,变分不等式的可解性可以通过算法产生的序列的性态来刻画.在适当的条件下,算法产生的序列强收敛于变分不等式的一个解,这是Bregman距离意义下离初始点最近的解.本文的主要结果推广和改善了近来文献中的相应结果.     

A modified descent method for co-coercive variational inequalities

This paper presents a modified descent method for solving co-coercive variational inequalities. Incorporating with the techniques of identifying descent directions and optimal step sizes along these directions, the new method improves the efficiencies of some existing projection methods. Some numerical results for an economic equilibrium problem are reported.     

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.