A modified subgradient extragradient method for solving the variational inequality problem
نویسندگان
چکیده
منابع مشابه
A modified subgradient extragradient method for solving monotone variational inequalities
In the setting of Hilbert space, a modified subgradient extragradient method is proposed for solving Lipschitz-continuous and monotone variational inequalities defined on a level set of a convex function. Our iterative process is relaxed and self-adaptive, that is, in each iteration, calculating two metric projections onto some half-spaces containing the domain is involved only and the step siz...
متن کاملStrong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
We study two projection algorithms for solving the Variational Inequality Problem (VIP) in Hilbert space. One algorithm is a modi ed subgradient extragradient method in which an additional projection onto the intersection of two half-spaces is employed. Another algorithm is based on the shrinking projection method. We establish strong convergence theorems for both algorithms.
متن کاملThe Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Space
We present a subgradient extragradient method for solving variational inequalities in Hilbert space. In addition, we propose a modified version of our algorithm that finds a solution of a variational inequality which is also a fixed point of a given nonexpansive mapping. We establish weak convergence theorems for both algorithms.
متن کاملStrong Convergence of the Halpern Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Spaces
In this paper, we combine the subgradient extragradient method with the Halpern method for finding a solution of a variational inequality involving a monotone Lipschitz mapping in Banach spaces. By using the generalized projection operator and the Lyapunov functional introduced by Alber, we prove a strong convergence theorem. We also consider the problem of finding a common element of the set o...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2018
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-017-0467-x