A Modified Mann Algorithm For Solving Convex Minimization And Fixed Point Problems With Composed Nonlinear Operators

被引：0

作者：

Sow, Thierno Mohamadane Mansour ^{[1
]}

Djitte, Ngalla ^{[2
]}

El Yekheir, Yahya Baba ^{[2
]}

机构：

[1] Amadou Mahtar Mbow Univ, Dakar, Senegal

[2] Gaston Berger Univ, Dept Math, St Louis, Senegal

来源：

APPLIED MATHEMATICS E-NOTES | 2020年 / 20卷

关键词：

STRONG-CONVERGENCE THEOREMS; NONEXPANSIVE-MAPPINGS; ITERATION; WEAK;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The main aim of this paper is to introduce and study an iterative algorithm, which is based on the Krasnoselskii-Mann iterative method and the gradient-projection algorithm for solving a constrained convex minimization problem and fixed point problem with quasi-nonexpansive and firmly nonexpansive mappings in a real Hilbert space. Finally, we apply our main result for finding a common solution of convex minimization problem,fixed point problem and equilibrium problem. Essentially, a new approach for solving some nonlinear problems is provided.

引用

页码：462 / 475

页数：14

共 36 条

[31]

Taiwo A., 2019, RIC MAT, V69, P235

[32] Iterative algorithms for nonlinear operators [J].