LE QUY DON
Technical University
VietnameseClear Cookie - decide language by browser settings

A modified Solodov-Svaiter method for solving nonmonotone variational inequality problems

Van Dinh, Bui and Manh, Hy Duc and Thanh, Tran Thi Huyen (2022) A modified Solodov-Svaiter method for solving nonmonotone variational inequality problems. Numerical Algorithms. ISSN 1017-1398

Full text not available from this repository. (Upload)

Abstract

In a very interesting paper (SIAM J. Control Optim. 37(3): 765–776, 1999), Solodov and Svaiter introduced an effective projection algorithm with linesearch for finding a solution of a variational inequality problem (VIP) in Euclidean space. They showed that the iterative sequence generated by their algorithm converges to a solution of (VIP) under the main assumption that the cost mapping is pseudomonotone and continuous. In this paper, we propose to modify this algorithm for solving variational inequality problems in which the cost mapping is not required to be satisfied any pseudomonotonicity. Moreover, we do not use the embedded projection methods as in methods used in literature and the linesearch procedure is not necessary when the cost mapping is Lipschitz. Several numerical examples are also provided to illustrate the efficient of the proposed algorithms. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

Item Type: Article
Divisions: Faculties > Faculty of Information Technology
Identification Number: 10.1007/s11075-021-01248-w
Uncontrolled Keywords: Armijo linesearch; Non-monotonicity; Projection algorithm; Variational inequalities
URI: http://eprints.lqdtu.edu.vn/id/eprint/10394

Actions (login required)

View Item
View Item