𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new modified Goldstein-Levitin-Polyakprojection method for variational inequality problems

✍ Scribed by Derek Han; Wenyu Sun


Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
528 KB
Volume
47
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, we first show that the adjustment parameter in the step size choice strategy of the modified Goldstein-Levitin-Polyak projection method proposed by He et al. for asymmetric strongly monotone variational inequality problems can be bounded away from zero by a positive constant. Under this observation, we propose a new step size rule which seems to be more practical and robust than the original one. We show that the new modified method is globally convergent under the same conditions and report some computational results to illustrate the method. @


πŸ“œ SIMILAR VOLUMES


A modified inexact implicit method for m
✍ Abdellah Bnouhachem; Min Li; Mohamed Khalfaoui; Sheng Zhaohan πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 329 KB

In this paper, we suggest and analyze an inexact implicit method with a variable parameter for mixed variational inequalities by using a new inexactness restriction. Under certain conditions, the global convergence of the proposed method is proved. Some preliminary computational results are given to

An improved Goldstein's type method for
✍ Min Li; Xiao-ming Yuan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 155 KB

This paper aims at presenting an improved Goldstein's type method for a class of variant variational inequalities. In particular, the iterate computed by an existing Goldstein's type method [He, A Goldstein's type projection method for a class of variant variational inequalities J. Comput. Math. 17(

A simple self-adaptive alternating direc
✍ Deren Han; Hong K. Lo; Zhiwei Wang πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 232 KB

In this study, we propose a new alternating direction method for solving linear variational variational inequality problems (LVIP). It is simple in the sense that, at each iteration, it needs only to perform a projection onto a simple set and some matrix-vector multiplications. The simplicity of the