Accelerated Self-Adaptive Method for Solving Nonsmooth Convex Minimization Problem in Real Hilbert Spaces
Résumé
In this manuscript, we propose a proximal gradient type algorithm together with a two step inertia method for approximating solution of convex minimization problem in real Hilbert spaces. The proposed proximal gradient type method is designed in such a way that it does not depend on the Lipschitz constant. Using a self-adaptive rule, we obtain a weak convergence result under the condition that the gradient function of one of the convex functions is uniformly continuous. Preliminary numerical results show that our proposed method has a better convergence in comparison to some other related results in the literature.
Citer ce document
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 revueLicence et provenance
Licence : CC BY
Notice moissonnée depuis OpenAlex le 28/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →