Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity
نویسندگان
چکیده
منابع مشابه
Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity
We propose an approximate proximal algorithm for solving generalized variational inequalities in Hilbert space. Extension to Bregman-function-based approximate proximal algorithm is also discussed. Weak convergence of these two algorithms are established under the paramonotonicity and pseudomonotonicity assumptions of the operators. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملψ-pseudomonotone generalized strong vector variational inequalities with application
In this paper, we establish an existence result of the solution for an generalized strong vector variational inequality already considered in the literature and as applications we obtain a new coincidence point theorem in Hilbert spaces.
متن کاملVector Optimization Problems and Generalized Vector Variational-Like Inequalities
In this paper, some properties of pseudoinvex functions, defined by means of limiting subdifferential, are discussed. Furthermore, the Minty vector variational-like inequality, the Stampacchia vector variational-like inequality, and the weak formulations of these two inequalities defined by means of limiting subdifferential are studied. Moreover, some relationships between the vector vari...
متن کامل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 res...
متن کاملProximal extrapolated gradient methods for variational inequalities
The paper concerns with novel first-order methods for monotone variational inequalities. They use a very simple linesearch procedure that takes into account a local information of the operator. Also, the methods do not require Lipschitz continuity of the operator and the linesearch procedure uses only values of the operator. Moreover, when the operator is affine our linesearch becomes very simp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2008
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.06.010