A feasible descent algorithm for solving variational inequality problems

Deren Han () and Hong K. Lo ()

Mathematical Methods of Operations Research, 2003, vol. 58, issue 2, 259-269

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. Copyright Springer-Verlag 2003

Keywords: Strongly monotone variational inequalities; Feasible descent methods; Regularized gap functions; Global convergence (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300282 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:58:y:2003:i:2:p:259-269

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860300282

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().