Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem

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 tha...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization letters Ročník 17; číslo 8; s. 1957 - 1978
Hlavní autori:	Ertürk, Müzeyyen, Salkım, Ahmet
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2023
Predmet:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation Gradient projection algorithm Bounded perturbation resilience Convex minimization problems Linear inverse problems Superiorization Split feasibility problems
ISSN:	1862-4472, 1862-4480
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!