A hybrid inertial algorithm for approximating solution of convex feasibility problems with applications
Abstract An inertial iterative algorithm for approximating a point in the set of zeros of a maximal monotone operator which is also a common fixed point of a countable family of relatively nonexpansive operators is studied. Strong convergence theorem is proved in a uniformly convex and uniformly smo...
Guardado en:
Autores principales: | , , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
SpringerOpen
2020
|
Materias: | |
Acceso en línea: | https://doaj.org/article/371af04549ac430095a86c6b56d266be |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|