| Autor: |
Ertürk, Müzeyyen, Salkım, Ahmet |
| Zdroj: |
Optimization Letters; Nov2023, Vol. 17 Issue 8, p1957-1978, 22p |
| Abstrakt: |
In this article, we use the superiorization methodology to investigate the bounded perturbations resilience of the gradient projection algorithm proposed in Ertürk et al. (J Nonlinear Convex Anal 21(4):943–951, 2020) for solving the convex minimization problem in Hilbert space setting. We obtain that the perturbed version of this gradient projection algorithm converges weakly to a solution of the convex minimization problem just like itself. We support our conclusion with an example in an infinitely dimensional Hilbert space. We also show that the superiorization methodology can be applied to the split feasibility and the inverse linear problems with the help of the perturbed gradient projection algorithm. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink