.png){kind=icon}
.png){kind=icon}
Return
An iterative algorithm for approximating convex minimization problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.10.039.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We suggest and analyze an iterative algorithm without the assumption of any type of commutativity on an infinite family of nonexpansive mappings. We show that the proposed iterative algorithm converges to the unique minimizer of some quadratic function over the common fixed point sets of an infinite family of nonexoansive mappings. Our result extend and improve many results announced by many authors. (C) 2006 Elsevier Inc. All rights reserved.
Keywords:
nonexpansive mapping
fixed point
convex minimization problem
iterative algorithm
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available