Monotone generalized variational inequalities and generalized complementarity problems

Some existence results for generalized variational inequalities and generalized complementarity problems involving quasimonotone and pseudomonotone set-valued mappings in reflexive Banach spaces are proved. In particular, some known results for nonlinear variational inequalities and complementarity problems in finite-dimensional and infinite-dimensional Hilbert spaces are generalized to quasimonotone and pseudomonotone set-valued mappings and reflexive Banach spaces. Application to a class of generalized nonlinear complementarity problems studied as mathematical models for mechanical problems is given.The research of the first author was supported by the National Natural Science Foundation of P. R. China and by the Ethel Raybould Fellowship, University of Queensland, St. Lucia, Brisbane, Australia.     

广义Minty 向量似变分不等式解的性质

在拓扑向量空间中讨论下Dini方向导数形式的广义Minty向量似变分不等式问题. 可微形式的Minty变分不等式、Minty似变分不等式和Minty向量变分不等式是其特殊形式. 该文分别讨论了Minty向量似变分不等式的解与径向递减函数, 与向量优化问题的最优解或有效解之间的关系问题, 以及Minty向量似变分不等式的解集的仿射性质. 这些定理推广了文献中Minty变分不等式的一些重要的已知结果.     

Weighted variational inequalities in non-pivot Hilbert spaces with applications

We introduce variational inequalities defined in non-pivot Hilbert spaces and we show some existence results. Then, we prove regularity results for weighted variational inequalities in non-pivot Hilbert space. These results have been applied to the weighted traffic equilibrium problem. The continuity of the traffic equilibrium solution allows us to present a numerical method to solve the weighted variational inequality that expresses the problem. In particular, we extend the Solodov-Svaiter algorithm to the variational inequalities defined in finite-dimensional non-pivot Hilbert spaces. Then, by means of a interpolation, we construct the solution of the weighted variational inequality defined in a infinite-dimensional space. Moreover, we present a convergence analysis of the method.     

A modified Korpelevich's method convergent to the minimum-norm solution of a variational inequality

In this article, we propose a modified Korpelevich's method for solving variational inequalities. Under some mild assumptions, we show that the suggested method converges strongly to the minimum-norm solution of some variational inequality in an infinite-dimensional Hilbert space.     

The iterative methods for monotone generalized variational inequalities

A new class of iterative methods are presented for monotone generalized variational inequality problems. These methods, which base on an equivalent formulation of the original problem, can be viewed as the extension of the symmetric projection rnethod for monotone variational inequalities. The global convergence of the methods is estab-lished under the monotonicity assumption on the functions associated the problem.Specialization of the proposed algorithms and related results to several special cases are also discussed. Moreover, two combination methods are presented for affine monotone problems. and their global and Q-linear convergence are also established     

Generalized variational inequalities with generalized coercivity conditions

Some results due to Fang and Peterson on generalized variational inequalities in the space ? ⁿ are extended to infinite-dimensional spaces. Theorems on the existence of solutions of such inequalities under generalized coercivity conditions are obtained.     

Pseudomonotone Variational Inequalities: Convergence of Proximal Methods

In this paper, we study the convergence of proximal methods for solving pseudomonotone (in the sense of Karamardian) variational inequalities. The main result is given in the finite-dimensional case, but we show that we still obtain convergence in an infinite-dimensional Hilbert space under a strong pseudomonotonicity or a pseudo-Dunn assumption on the operator involved in the variational inequality problem.     

A Linearization Method for Nondegenerate Variational Conditions

We employ recent results about constraint nondegeneracy in variational conditions to design and justify a linearization algorithm for solving such problems. The algorithm solves a sequence of affine variational inequalities, but the variational condition itself need not be a variational inequality: that is, its underlying set need not be convex. However, that set must be given by systems of differentiable nonlinear equations with additional polyhedral constraints. We show that if the variational condition has a solution satisfying nondegeneracy and a standard regularity condition, and if the linearization algorithm is started sufficiently close to that solution, the algorithm will produce a well defined sequence that converges Q-superlinearly to the solution.     

Extended Antipodal Theorems

In infinite-dimensional Hilbert spaces, we prove that the iterative sequence generated by the extragradient method for solving pseudo-monotone variational inequalities converges weakly to a solution. A class of pseudo-monotone variational inequalities is considered to illustrate the convergent behavior. The result obtained in this note extends some recent results in the literature; especially, it gives a positive answer to a question raised in Khanh (Acta Math Vietnam 41:251–263, 2016).     

On the solution existence of pseudomonotone variational inequalities

As shown by Thanh Hao [Acta Math. Vietnam 31, 283–289, 2006], the solution existence results established by Facchinei and Pang [Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I (Springer, Berlin, 2003) Prop. 2.2.3 and Theorem 2.3.4] for variational inequalities (VIs) in general and for pseudomonotone VIs in particular, are very useful for studying the range of applicability of the Tikhonov regularization method. This paper proposes some extensions of these results of Facchinei and Pang to the case of generalized variational inequalities (GVI) and of variational inequalities in infinite-dimensional reflexive Banach spaces. Various examples are given to analyze in detail the obtained results. B. T. Kien: On leave from Hanoi University of Civil Engineering. The online version of the original article can be found at .     

Existence results for strong vector equilibrium problems and their applications

New existence results for the strong vector equilibrium problem are presented, relying on a well-known separation theorem in infinite-dimensional spaces. The main results are applied to strong cone saddle-points and strong vector variational inequalities providing new existence results, and furthermore they allow recovery of an earlier result from the literature.     

ON THE LINEAR CONVERGENCE OF PC-METHOD FOR A CLASS OF LINEAR VARIATIONAL INEQUALITIES

1.IntroductionLetMbeannxnmatrixandletqbeavectorinR",then-dimensionalEnclideanspace.Letfibeannonemptyclosedconvexset.Thelinearvariationalinequalityproblem(denotedby(LVI))istofindx*Efisuchthat(x~x*)"(MX* q)20,VxEfi.(1.1)Theproblem(1.1)iswellknowninoptimizationandcontainsasspecialcajseslinear(andquadratic)programming,bimatrixgame,etc.(seeCottleandDantzigti]).Whenfiisapolyhedralset,forconvenienceexpressedasX~{xER"IAx2b},AERm"",bERe,(1.2)itiscalledtheaffinevariationalinequalityproblem(AV…     

非强制混合向量变分不等式解的存在性研究

本文利用例外簇方法研究非强制混合向量变分不等式的弱有效解的存在性:首先证明若混合向量变分不等式问题不存在例外簇,则混合向量变分不等式问题的弱有效解集为非空集合:利用向量值映射的渐近映射给出自反Banach空间中非强制混合向量变分不等式的弱有效解集不存在例外簇的充分条件,从而得到混合向量变分不等式问题的弱有效解的存在性结...     

On stability of solutions to parametric generalized affine variational inequalities

This paper deals with the stability of the solution set to parametric generalized affine variational inequalities with constraint set being defined by finitely many convex quadratic functions. The obtained results develop and complement the published ones.     

Merit functions for general variational inequalities

In this paper, we consider some classes of merit functions for general variational inequalities. Using these functions, we obtain error bounds for the solution of general variational inequalities under some mild conditions. Since the general variational inequalities include variational inequalities, quasivariational inequalities and complementarity problems as special cases, results proved in this paper hold for these problems. In this respect, results obtained in this paper represent a refinement of previously known results for classical variational inequalities.     

On a system of general mixed variational inequalities

In this paper, we introduce and consider a new system of general mixed variational inequalities involving three different operators. Using the resolvent operator technique, we establish the equivalence between the general mixed variational inequalities and the fixed point problems. We use this equivalent formulation to suggest and analyze some new explicit iterative methods for this system of general mixed 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 mixed variational inequalities involving two operators, variational inequalities and related optimization problems as special cases, results obtained in this paper continue to hold for these problems. Our results can be viewed as a refinement and improvement of the previously known results for variational inequalities.     

Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators

The majority of first-order methods for large-scale convex–concave saddle point problems and variational inequalities with monotone operators are proximal algorithms. To make such an algorithm practical, the problem’s domain should be proximal-friendly—admit a strongly convex function with easy to minimize linear perturbations. As a by-product, this domain admits a computationally cheap linear minimization oracle (LMO) capable to minimize linear forms. There are, however, important situations where a cheap LMO indeed is available, but the problem domain is not proximal-friendly, which motivates search for algorithms based solely on LMO. For smooth convex minimization, there exists a classical algorithm using LMO—conditional gradient. In contrast, known to us similar techniques for other problems with convex structure (nonsmooth convex minimization, convex–concave saddle point problems, even as simple as bilinear ones, and variational inequalities with monotone operators, even as simple as affine) are quite recent and utilize common approach based on Fenchel-type representations of the associated objectives/vector fields. The goal of this paper was to develop alternative (and seemingly much simpler) decomposition techniques based on LMO for bilinear saddle point problems and for variational inequalities with affine monotone operators.     

Projection Method Approach for General Regularized Non-convex Variational Inequalities

In this paper, we investigate or analyze non-convex variational inequalities and general non-convex variational inequalities. Two new classes of non-convex variational inequalities, named regularized non-convex variational inequalities and general regularized non-convex variational inequalities, are introduced, and the equivalence between these two classes of non-convex variational inequalities and the fixed point problems are established. A projection iterative method to approximate the solutions of general regularized non-convex variational inequalities is suggested. Meanwhile, the existence and uniqueness of solution for general regularized non-convex variational inequalities is proved, and the convergence analysis of the proposed iterative algorithm under certain conditions is studied.     

Stopping Problems of Certain Multiplicative Functionals and Optimal Investment with Transaction Costs

Optimal stopping and impulse control problems with certain multiplicative functionals are considered. The stopping problems are solved by showing the unique existence of the solutions of relevant variational inequalities. However, since functions defining the multiplicative costs change the signs, some difficulties arise in solving the variational inequalities. Through gauge transformation we rewrite the variational inequalities in different forms with the obstacles which grow exponentially fast but with positive killing rates. Through the analysis of such variational inequalities we construct optimal stopping times for the problems. Then optimal strategies for impulse control problems on the infinite time horizon with multiplicative cost functionals are constructed from the solutions of the risk-sensitive variational inequalities of "ergodic type" as well. Application to optimal investment with fixed ratio transaction costs is also considered.     

Relative Pareto minimizers for multiobjective problems: existence and optimality conditions

In this paper we introduce and study enhanced notions of relative Pareto minimizers for constrained multiobjective problems that are defined via several kinds of relative interiors of ordering cones and occupy intermediate positions between the classical notions of Pareto and weak Pareto efficiency/minimality. Using advanced tools of variational analysis and generalized differentiation, we establish the existence of relative Pareto minimizers for general multiobjective problems under a refined version of the subdifferential Palais-Smale condition for set-valued mappings with values in partially ordered spaces and then derive necessary optimality conditions for these minimizers (as well as for conventional efficient and weak efficient counterparts) that are new in both finite-dimensional and infinite-dimensional settings. Our proofs are based on variational and extremal principles of variational analysis; in particular, on new versions of the Ekeland variational principle and the subdifferential variational principle for set-valued and single-valued mappings in infinite-dimensional spaces.