当前位置: X-MOL 学术J. Ind. Manage. Optim. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Multi-step iterative algorithm for minimization and fixed point problems in p-uniformly convex metric spaces
Journal of Industrial and Management Optimization ( IF 1.3 ) Pub Date : 2020-03-22 , DOI: 10.3934/jimo.2020063
Kazeem Olalekan Aremu , , Chinedu Izuchukwu , Grace Nnenanya Ogwo , Oluwatosin Temitope Mewomo ,

In this paper, we propose and study a multi-step iterative algorithm that comprises of a finite family of asymptotically $ k_i $-strictly pseudocontractive mappings with respect to $ p, $ and a $ p $-resolvent operator associated with a proper convex and lower semicontinuous function in a $ p $-uniformly convex metric space. Also, we establish the $ \Delta $-convergence of the proposed algorithm to a common fixed point of finite family of asymptotically $ k_i $-strictly pseudocontractive mappings which is also a minimizer of a proper convex and lower semicontinuous function. Furthermore, nontrivial numerical examples of our algorithm are given to show its applicability. Our results complement a host of recent results in literature.

中文翻译:

p-一致凸度量空间中最小化和不动点问题的多步迭代算法

在本文中,我们提出并研究了一种多步迭代算法,该算法包括有限元的渐近$ k_i $-严格伪压缩映射关于$ p,$和与适当凸和相关联的$ p $ -resolvent运算符。一致凸度量空间中的下半连续函数。同样,我们将拟议算法的$ \ Delta $收敛性建立到渐近$ k_i $-严格伪压缩映射的有限族的一个公共不动点,这也是适当的凸和下半连续函数的极小值。此外,给出了我们算法的非平凡的数值示例,以显示其适用性。我们的结果补充了文献中的许多最新结果。
更新日期:2020-03-22
down
wechat
bug