Skip to main content
Log in

A feasible descent algorithm for solving variational inequality problems

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deren Han.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Han, D., Lo, H. A feasible descent algorithm for solving variational inequality problems. Math Meth Oper Res 58, 259–269 (2003). https://doi.org/10.1007/s001860300282

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860300282

Key Words

Navigation