A feasible descent algorithm for solving variational inequality problems

A feasible descent algorithm for solving variational inequality problems

0.00 Avg rating0 Votes
Article ID: iaor20051081
Country: Germany
Volume: 58
Issue: 2
Start Page Number: 259
End Page Number: 269
Publication Date: Jan 2003
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

In this paper, for solving variational inequality problems (VIPs) we propose a feasible descent algorithm via minimizing the regularized gap function of Fukushima. Under the condition that the underlying mapping of VIP is strongly monotone, the algorithm is globally convergent for any regularized parameter, which is nice because it bypasses the necessity of knowing the modulus of strong monotonicity, a knowledge that is requested by other similar algorithms. Some preliminary computational results show the efficiency of the proposed method.

Reviews

Required fields are marked *. Your email address will not be published.