Iterative methods for solving variational inequality problems with a double-hierarchical structure in Hilbert spaces

This paper deals with a variational inequality problem over a solution set of another variational inequality problem, which essentially is called the double-hierarchical constrained optimization problem. Inertial-based algorithms are devised for this problem and solution theorems of strong convergen...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 72; no. 10; pp. 2433 - 2461
Main Authors Liu, Liya, Yao, Jen-Chih
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis 03.10.2023
Taylor & Francis LLC
Subjects
Algorithms
double-hierarchical
Hilbert space
inertial method
Iterative methods
Optimization
pseudomonotonicity
Tseng method
Variational inequality
Online AccessGet full text

Cover

More Information
Summary:This paper deals with a variational inequality problem over a solution set of another variational inequality problem, which essentially is called the double-hierarchical constrained optimization problem. Inertial-based algorithms are devised for this problem and solution theorems of strong convergence are established. Simulation results on numerical examples are given to illustrate the behaviour of our proposed algorithms compared with some existing ones.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2022.2074297