A general iterative algorithm for vector equilibrium problem

被引:1
|
作者
Huang, Jin-xia [1 ]
Wang, San-hua [1 ,2 ]
Mao, Jia-yu [1 ]
机构
[1] Nanchang Univ, Dept Math, Nanchang 330031, Jiangxi, Peoples R China
[2] Nanchang Univ, Postdoctor Stn Management Sci & Engn, Nanchang 330031, Jiangxi, Peoples R China
来源
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Vector equilibrium problem; auxiliary problem; iterative algorithm; metric projection; cone-continuity; FIXED-POINT; VALUED FUNCTIONS; MINIMAX THEOREM; EXISTENCE;
D O I
10.22436/jnsa.010.08.27
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, iterative algorithm for strong vector equilibrium problem (SVEP) is studied. Firstly, an auxiliary problem for SVEP is introduced and the relationships between the auxiliary problem and SVEP are discussed. Then, based on the auxiliary problem, a general iterative algorithm for SVEP is proposed. Moreover, analysis of convergence of this general iterative algorithm is investigated under suitable conditions of cone-continuity and cone-convexity. The main results obtained in this paper extend and develop the corresponding ones of [A. N. Iusem, W. Sosa, Optimization, 52 (2003), 301-316], [S.-H. Wang, Q.-Y. Li, Optimization, 64 (2015), 2049-2063], and [B. Cheng, S.-Y. Liu, J. Lanzhou Univ. Nat. Sci., 45 (2009), 105-109]. (c) 2017 All rights reserved.
引用
收藏
页码:4337 / 4351
页数:15
相关论文
共 50 条