.png){kind=icon}
.png){kind=icon}
Return
PROJECTION ALGORITHMS FOR FIXED POINT PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1017/s0004972726101117.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study projection algorithms for finding fixed points of nonexpansive mappings in a Hilbert space. In previous work, the well-definedness of the iterates depended on the nonemptiness of the fixed point set. We first show that the existence of the iterates generated by a general projection algorithm is independent of the existence of fixed points. Next, we introduce a multi-step inertial projection algorithm and establish results on existence, strong convergence and iteration complexity. Our results generalise and improve projection algorithms discussed in the literature.
Keywords:
nonexpansive mapping
metric projection
strong convergence
Hilbert space
Journal
B
IF:
0.5
Papers:
72
Citations:
0
