A new step size rule for the superiorization method and its application in computerized tomography
DOI10.1007/s11075-021-01229-zzbMath1492.65169OpenAlexW3212551358MaRDI QIDQ2672729
Touraj Nikazad, Mokhtar Abbasi, Tommy Elfving, L. Afzalipour
Publication date: 13 June 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01229-z
convex optimizationcomputed tomographyconvex feasibility problemsuperiorizationperturbation resilient iterative methodsequential block methodstrictly quasi-nonexpansive operator
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25) Iterative numerical methods for linear systems (65F10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Iterative methods for fixed point problems in Hilbert spaces
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Projected subgradient minimization versus superiorization
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- The Mathematics of Computerized Tomography
- Fundamentals of Computerized Tomography
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
- Convergence of string-averaging method for a class of operators
- Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings
- Perturbation resilience and superiorization of iterative algorithms
- Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
- On Diagonally Relaxed Orthogonal Projection Methods
- Properties of a class of block-iterative methods
- Total variation superiorized conjugate gradient method for image reconstruction
- FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Discrete Inverse Problems
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Can linear superiorization be useful for linear optimization problems?
- Superiorization with level control
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
This page was built for publication: A new step size rule for the superiorization method and its application in computerized tomography
