求解次压缩算子分裂问题的自适应算法  

Self-adaptive Algorithm to Solve Sub-contractive Operator Split Problem

作　　者：贾倩倩 高兴慧[1] JIA Qian-qian;GAO Xing-hui(School of Mathematics and Computer Science,Yan′an University,Yan′an 716000,China)

机构地区：[1]延安大学数学与计算机科学学院,陕西延安716000

出　　处：《延安大学学报（自然科学版）》2020年第2期21-23,27,共4页Journal of Yan'an University：Natural Science Edition

摘　　要：在Hilbert空间中设计了一种粘滞逼近方法的自适应迭代算法,并利用粘滞逼近方法和自伴算子技巧求解了次压缩算子的分裂问题。所得结果推广和改进了一些最新的结果。In a Hilbert space,a self-adaptive iterative algorithm by viscosity approximation method is designed,and the split problem of sub-contractive operator is solved by using viscosity approximation operator and self-adaptive operator technique.The results generalize and improve some latest results.

关 键 词：粘滞迭代 自适应算法 次压缩算子 分裂问题 

分 类 号：O177.91[理学—数学]