检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:党亚峥[1] 刘雯雯[1] DANG Ya-zheng;LIU Wen-wen(School of Management,University of Shanghai for Science and Technology,Shanghai 200093)
出 处:《工程数学学报》2018年第5期601-610,共10页Chinese Journal of Engineering Mathematics
基 金:The Natural Science Foundation of Shanghai(14ZR1429200);the Innovation Program of Shanghai Municipal Education Commission(15ZZ073)
摘 要:本文提出了稳固非扩张映射不动点集处均衡问题的一种新算法.该算法要求双函数是连续的,但不一定是单调的.首先,通过事先引入的参数确定一个闭凸集;其次,根据双函数的不精确次梯度在闭凸集上的投影构造中间迭代点;最后,下一个迭代点由当前迭代点和中间迭代点的凸组合在稳固非扩张算子的映射得到.在适当条件下,本文给出了该算法的全局收敛性证明.In this paper,we present a new method for solving equilibrium problem over the fixed point set of a firmly nonexpansive mapping,where the underlying bifunction is continuous but not necessarily monotone.Firstly,we construct a closed ball by introducing some parameters.Then,we calculate the intermediate iterate by the projection of the inexact subgradient onto the closed convex set.The next iterate is obtained as the firmly nonexpansive mapping of a convex combination,which consists of the current iterate and the intermediate iterate.Finally,we analyse the convergence properties and the global convergence of the algorithm under some suitable conditions.
关 键 词:均衡问题 稳固非扩张映射 不精确次梯度算法 全局收敛性
分 类 号:O224.1[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229