Projected Reflected Gradient Methods for Monotone Variational Inequalities
نویسندگان
چکیده
منابع مشابه
Projected Reflected Gradient Methods for Monotone Variational Inequalities
This paper is concerned with some new projection methods for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. First, we propose the projected reflected gradient algorithm with a constant stepsize. It is similar to the projected gradient method, namely, the method requires only one projection onto the feasible set and only one value of the ...
متن کاملRecession Methods in Monotone Variational Hemivariational Inequalities
Throughout the paper we use standard notations except special symbols introduced when they are defined. All spaces considered are Banach spaces whose norms are always denoted by ‖ · ‖. For any space V we consider its dual space V ? equipped with the strong topology. We denote by 〈·, ·〉 the duality pairing between V and V . Let f : V → R ∪ {∞} be an extended-real-valued function. Identifying ext...
متن کامل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...
متن کاملMonotone Multigrid Methods for Elliptic Variational Inequalities Ii 1
We derive fast solvers for discrete elliptic variational inequalities of the second kind as resulting from the approximation by piecewise linear nite elements. Following the rst part of this paper, monotone multigrid methods are considered as extended underrelaxations. Again, the coarse grid corrections are localized by suitable constraints, which in this case are xed by ne grid smoothing. We c...
متن کاملMonotone Multigrid Methods for Elliptic Variational Inequalities I 1
We derive fast solvers for discrete elliptic variational inequalities of the rst kind (obstacle problems) as resulting from the approximation of related continuous problems by piecewise linear nite elements. Using basic ideas of successive subspace correction, we modify well{known relaxation methods by extending the set of search directions. Extended under-relaxations are called monotone multig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2015
ISSN: 1052-6234,1095-7189
DOI: 10.1137/14097238x