检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王元恒 许甜甜 姚任之 姜炳男 Yuan Heng WANG;Tian Tian XU;Jen-Chih YAO;Bing Nan JIANG(College of Humanities,Zhejiang Guangsha Vicationl and Technical University of Constraction,Jinhua 322100,P.R.China;School of Mathematical Sciences,Zhejiang Normal Uinversity,Jinhua 321004,P.R.China)
机构地区:[1]浙江广厦建设职业技术大学人文学院,金华322100 [2]浙江师范大学数学科学学院,金华321004
出 处:《数学学报(中文版)》2024年第4期704-718,共15页Acta Mathematica Sinica:Chinese Series
基 金:国家自然科学基金资助项目(12171435)。
摘 要:本文研究了Hilbert空间中求解分裂可行性问题和拟非扩张算子不动点问题的公共解的一种新算法,并在这两类问题公共解的基础上求解了变分不等式问题.与前人相比,增加了自适应的步长和惯性迭代算法,加快了算法生成的迭代序列的收敛速度.同时,将先前涉及的非扩张映射推广到拟非扩张映射,且在算法中加入了一个强正有界算子,将原来的黏性迭代算法推广到更一般的黏性迭代算法.在数值算例中验证了算法的有效性.We study a new algorithm to solve a common solution of the split feasibility problem and the fixed point problem involving quasi-nonexpansive mappings in Hilbert spaces.Based on the common solutions of these two classes of problems,we solve the variational inequality problem.Compared with the predecessors,the self-adaptive technique and the inertial iteration method are added,which can speed up the convergence rate of the iterative sequence generated by our algorithms.At the same time,we extend the involving previous nonexpansive mappings to extensive quasi-nonexpansive mappings.In addition,a strong positive bounded operator is added to the algorithm,which extends the original viscous iterative algorithm to a more general viscous iterative algorithm.The effectiveness of the algorithm is verified by numerical examples.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7