Accès ouvert · CC BY

A hybrid inertial algorithm for approximating solution of convex feasibility problems with applications

Article scientifique 2020 Sciences mathématiques et statistiques Anglais

Résumé

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 smooth real Banach space. This theorem extends, generalizes and complements several recent important results. Furthermore, the theorem is applied to convex optimization problems and to J-fixed point problems. Finally, some numerical examples are presented to show the effect of the inertial term in the convergence of the sequence of the algorithm.

Citer ce document

Chidume, C., Kumam, P., & Adamu, A. (2020). A hybrid inertial algorithm for approximating solution of convex feasibility problems with applications. Fixed Point Theory and Applications. https://doi.org/10.1186/s13663-020-00678-w

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 04/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 24

Téléchargements (hors robots) : 0

Méthode de comptage