A new step size rule for the superiorization method and its application in computerized tomography
DOI10.1007/S11075-021-01229-ZzbMATH Open1492.65169OpenAlexW3212551358MaRDI QIDQ2672729FDOQ2672729
Authors: Touraj Nikazad, Mokhtar Abbasi, L. Afzalipour, T. Elfving 
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
Recommendations
- Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
- Projected subgradient minimization versus superiorization
- Superiorization of preconditioned conjugate gradient algorithms for tomographic image reconstruction
- Superiorization for image analysis
- Total variation superiorized conjugate gradient method for image reconstruction
convex optimizationcomputed tomographyconvex feasibility problemsuperiorizationperturbation resilient iterative methodsequential block methodstrictly quasi-nonexpansive operator
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Iterative numerical methods for linear systems (65F10) Iterative procedures involving nonlinear operators (47J25)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
- Fundamentals of Computerized Tomography
- On Projection Algorithms for Solving Convex Feasibility Problems
- Weak and strong superiorization: between feasibility-seeking and minimization
- The mathematics of computerized tomography
- Iterative methods for fixed point problems in Hilbert spaces
- Title not available (Why is that?)
- Discrete inverse problems. Insight and algorithms.
- Incremental subgradient methods for nondifferentiable optimization
- 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
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Properties of a class of block-iterative methods
- Projected subgradient minimization versus superiorization
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Superiorization with level control
- Total variation superiorized conjugate gradient method for image reconstruction
- Can linear superiorization be useful for linear optimization problems?
- Convergence of string-averaging method for a class of operators
Cited In (5)
- Choosing relaxation parameter in randomized Kaczmarz method
- Total variation superiorized conjugate gradient method for image reconstruction
- Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation
- Computerized tomography with total variation and with shearlets
- Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
Uses Software
This page was built for publication: A new step size rule for the superiorization method and its application in computerized tomography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672729)
