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

Full description

Bibliographic Details

Published in:	Optimization letters Vol. 17; no. 8; pp. 1957 - 1978
Main Authors:	Ertürk, Müzeyyen, Salkım, Ahmet
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!