Open Access
April, 2024 Inertial Algorithms for Solving Nonmonotone Variational Inequality Problems
Bien Thanh Tuyen, Hy Duc Manh, Bui Van Dinh
Author Affiliations +
Taiwanese J. Math. 28(2): 397-421 (April, 2024). DOI: 10.11650/tjm/231202

Abstract

In this paper, we will construct an inertial algorithm without using the embedded projection method to find a solution of variational inequality problems in which the cost mapping is not required to be satisfied any pseudomonotonicity. The iterative sequences generated by algorithms under the main assumption $S_{M} \neq \emptyset$ are proved that they converge to a solution of the corresponding problems. In addition, numerical experiments are provided to show the effectiveness of the algorithm.

Acknowledgments

A part of this article was written while the third author was visiting Vietnam Institute for Advanced Study in Mathematics (VIASM). He would like to thank the institute for warm hospitality and partial support.

Citation

Download Citation

Bien Thanh Tuyen. Hy Duc Manh. Bui Van Dinh. "Inertial Algorithms for Solving Nonmonotone Variational Inequality Problems." Taiwanese J. Math. 28 (2) 397 - 421, April, 2024. https://doi.org/10.11650/tjm/231202

Information

Received: 26 June 2023; Revised: 17 November 2023; Accepted: 3 December 2023; Published: April, 2024
First available in Project Euclid: 19 March 2024

MathSciNet: MR4719944
Digital Object Identifier: 10.11650/tjm/231202

Subjects:
Primary: 47J20 , 49J40 , 90C33

Keywords: inertial algorithm , nonmonotone , projection , variational inequality

Rights: Copyright © 2024 The Mathematical Society of the Republic of China

Vol.28 • No. 2 • April, 2024
Back to Top