Modified projection method for strongly pseudomonotone variational inequalities

A modified projection method for strongly pseudomonotone variational inequalities is considered. Strong convergence and error estimates for the sequences generated by this method are studied in two versions of the method: the stepsizes are chosen arbitrarily from a given fixed closed interval and the stepsizes form a non-summable decreasing sequence of positive real numbers. We also propose some interesting examples to analyze the obtained results.     

Modified self-adaptive projection method for solving pseudomonotone variational inequalities

In this paper, a self-adaptive projection method with a new search direction for solving pseudomonotone variational inequality (VI) problems is proposed, which can be viewed as an extension of the methods in [B.S. He, X.M. Yuan, J.Z. Zhang, Comparison of two kinds of prediction-correction methods for monotone variational inequalities, Computational Optimization and Applications 27 (2004) 247-267] and [X.H. Yan, D.R. Han, W.Y. Sun, A self-adaptive projection method with improved step-size for solving variational inequalities, Computers & Mathematics with Applications 55 (2008) 819-832]. The descent property of the new search direction is proved, which is useful to guarantee the convergence. Under the relatively relaxed condition that F is continuous and pseudomonotone, the global convergence of the proposed method is proved. Numerical experiments are provided to illustrate the efficiency of the proposed method.     

Halpern projection methods for solving pseudomonotone multivalued variational inequalities in Hilbert spaces

In this paper, we introduce new approximate projection and proximal algorithms for solving multivalued variational inequalities involving pseudomonotone and Lipschitz continuous multivalued cost mappings in a real Hilbert space. The first proposed algorithm combines the approximate projection method with the Halpern iteration technique. The second one is an extension of the Halpern projection method to variational inequalities by using proximal operators. The strongly convergent theorems are established under standard assumptions imposed on cost mappings. Finally we introduce a new and interesting example to the multivalued cost mapping, and show its pseudomontone and Lipschitz continuous properties. We also present some numerical experiments to illustrate the behavior of the proposed algorithms.

     

Modified golden ratio algorithms for pseudomonotone equilibrium problems and variational inequalities

Applications of Mathematics - We propose a modification of the golden ratio algorithm for solving pseudomonotone equilibrium problems with a Lipschitz-type condition in Hilbert spaces. A new...     

Noncoercive variational inequalities for pseudomonotone operators

Compatibility conditions for noncoercive variational inequalities are given together with applications to quasi-linear systems of elliptic equations, elliptic variational inequalities with convection terms, closedness of algebraic difference of convex sets and lower semicontinuity of the infimal-convolution. Si provano alcune condizioni di compatibilità astratte per disequazioni variazionali noncoercive. Se ne deducono: risultati di esistenza per sistemi quasi-lineari di equazioni ellittiche e disequazioni variazionali con termini di trasporto, criteri di chiusura della differenza algebrica di convessi in spazi di Banach, e di semicontinuità per la inf-convoluzione di funzionali.

---

(Conferenza tenuta il 4 febbraio 1992)     

On gradient projection methods for strongly pseudomonotone variational inequalities without Lipschitz continuity

In this paper, we propose two new self-adaptive algorithms for solving strongly pseudomonotone variational inequalities. Our algorithms use dynamic step-si     

A relaxed projection method for variational inequalities

This paper presents a modification of the projection methods for solving variational inequality problems. Each iteration of the proposed algorithm consists of projection onto a halfspace containing the given closed convex set rather than the latter set itself. The algorithm can thus be implemented very easily and its global convergence to the solution can be established under suitable conditions.This work was supported in part by Scientific Research Grant-in-Aid from the Ministry of Education, Science and Culture, Japan.     

Self-adaptive projection method for co-coercive variational inequalities

In some real-world problems, the mapping of the variational inequalities does not have any explicit forms and only the function value can be evaluated or observed for given variables. In this case, if the mapping is co-coercive, the basic projection method is applicable. However, in order to determine the step size, the existing basic projection method needs to know the co-coercive modulus in advance. In practice, usually even if the mapping can be characterized co-coercive, it is difficult to evaluate the modulus, and a conservative estimation will lead an extremely slow convergence. In view of this point, this paper presents a self-adaptive projection method without knowing the co-coercive modulus. We also give a real-life example to demonstrate the practicability of the proposed method.     

Qualitative properties of strongly pseudomonotone variational inequalities

Qualitative properties of strongly pseudomonotone variational inequalities such as solution existence, stability and global error bound are studied in this paper.     

New extragradient-like algorithms for strongly pseudomonotone variational inequalities

The paper considers two extragradient-like algorithms for solving variational inequality problems involving strongly pseudomonotone and Lipschitz continuous operators in Hilbert spaces. The projection method is used to design the algorithms which can be computed more easily than the regularized method. The construction of solution approximations and the proof of convergence of the algorithms are performed without the prior knowledge of the modulus of strong pseudomonotonicity and the Lipschitz constant of the cost operator. Instead of that, the algorithms use variable stepsize sequences which are diminishing and non-summable. The numerical behaviors of the proposed algorithms on a test problem are illustrated and compared with those of several previously known algorithms.     

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.     

Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems

Numerical Algorithms - In this paper, we investigate two new algorithms for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The advantages of our algorithms...     

Strict feasibility of pseudomonotone set-valued variational inequalities

In this article, we use degree theory developed in Kien et al. [B.T. Kien, M.-M. Wong, N.C. Wong, and J.C. Yao, Degree theory for generalized variational inequalities and applications, Eur. J. Oper. Res. 193 (2009), pp. 12–22.] to prove a result on the existence of solutions to set-valued variational inequality under a weak coercivity condition, provided that the set-valued mapping is upper semicontinuous with nonempty compact convex values. If the set-valued mapping is pseudomonotone in the sense of Karamardian and upper semicontinuous with nonempty compact convex values, it is shown that the set-valued variational inequality is strictly feasible if and only if its solution set is nonempty and bounded.     

Partial solution for an open question on pseudomonotone variational inequalities

This article gives a partial solution for the open question raised by Nguyen Thanh Hao [Tikhonov regularization algorithm for pseudomonotone variational inequalities, Acta Math. Vietnam., 31 (2006), 283–289] about uniqueness of the solution of the regularized problem VI(K,?F _?) of a pseudomonotone variational inequality VI(K,?F) for sufficiently small parameter ??>?0. It is proved that, under certain additional assumptions, the desired solution uniqueness holds for some classes of pseudoaffine variational inequalities and pseudomonotone variational inequalities.     

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 .     

An extragradient algorithm for solving bilevel pseudomonotone variational inequalities

We present an extragradient-type algorithm for solving bilevel pseudomonone variational inequalities. The proposed algorithm uses simple projection sequences. Under mild conditions, the convergence of the iteration sequences generated by the algorithm is obtained.     

A modified projection method for solving co-coercive variational inequalities

This paper presents a modified projection method for solving variational inequalities, which can be viewed as an improvement of the method of Yan, Han and Sun [X.H. Yan, D.R. Han, W.Y. Sun, A modified projection method with a new direction for solving variational inequalities, Applied Mathematics and Computation 211 (2009) 118-129], by adopting a new prediction step. Under the same assumptions, we establish the global convergence of the proposed algorithm. Some preliminary computational results are reported.     

Fixed point methods for pseudomonotone variational inequalities involving strict pseudocontractions

We introduce a new iteration method for finding a common element of the set of solutions of a variational inequality problem and the set of fixed points of strict pseudocontractions in a real Hilbert space. The weak convergence of the iterative sequences generated by the method is obtained thanks to improve and extend some recent results under the assumptions that the cost mapping associated with the variational inequality problem only is pseudomonotone and not necessarily inverse strongly monotone. Finally, we present some numerical examples to illustrate the behaviour of the proposed algorithm.     

A new projection method for a class of variational inequalities

In this paper, we revisit the numerical approach to variational inequality problems involving strongly monotone and Lipschitz continuous operators by a variant of projected reflected gradient method. Contrary to what done so far, the resulting algorithm uses a new simple stepsize sequence which is diminishing and nonsummable. This brings the main advantages of the algorithm where the construction of aproximation solutions and the formulation of convergence are done without the prior knowledge of the Lipschitz and strongly monotone constants of cost operators. The assumptions in the formulation of theorem of convergence are also discussed in this paper. Numerical results are reported to illustrate the behavior of the new algorithm and also to compare with others.