Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
From MaRDI portal
Publication:6081606
DOI10.1007/s11590-022-01961-yMaRDI QIDQ6081606
Publication date: 26 October 2023
Published in: Optimization Letters (Search for Journal in Brave)
gradient projection algorithmbounded perturbation resilienceconvex minimization problemssuperiorizationlinear inverse problemssplit feasibility problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval
- Averaged mappings and the gradient-projection algorithm
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- New approximation schemes for general variational inequalities
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- A Picard-type iterative algorithm for general variational inequalities and nonexpansive mappings
- Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
- Perturbation resilience and superiorization of iterative algorithms
- Fixed Points by a New Iteration Method
- S-iterative algorithm for solving variational inequalities
- Some convergence, stability and data dependency results for a Picard-S iteration method of quasi-strictly contractive operators
- Superiorization for Image Analysis
- A Picard-S iterative method for approximating fixed point of weak-contraction mappings
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Mean Value Methods in Iteration
- Bounded perturbation resilience of projected scaled gradient methods
This page was built for publication: Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
