A HYBRID STEEPEST DESCENT METHOD FOR BILEVEL VARIATIONAL INEQUALITY PROBLEMS WITH THE FIXED POINT SET

被引:0
|
作者
Ram, Tirth [1 ]
Iqbal, Mohd [1 ]
Bhagat, Zeenat [1 ]
机构
[1] Univ Jammu, Dept Math, Jammu 180006, India
来源
关键词
fixed point; bilevel variational inequality; Hilbert space; descent method; Lipschitz continuous; nonexpansive mapping; STRONG-CONVERGENCE; PROJECTION; ALGORITHM; STEP;
D O I
10.54379/JIASF-2024-3-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we present a new hybrid steepest decent algorithm to solve the bilevel variational inequality problems, where the feasible set is the intersection of a variational inequality problem and the fixed point set of a nonexpansive mapping in a real Hilbert space. An iterative algorithm is introduced by using the hybrid steepest descent method and fixed-point formulation techniques. The strong convergence of the iterative sequences generated by the algorithm is shown under some suitable assumptions. In addition, the efficiency of our suggested algorithm is established by a numerical example.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 50 条