A relaxation method for reconstructing objects from noisy X-rays
From MaRDI portal
Publication:4053008
DOI10.1007/BF01580425zbMath0298.65028MaRDI QIDQ4053008
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Algorithms in computer science (68W99)
Related Items (24)
The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments ⋮ On some optimization techniques in image reconstruction from projections ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ A proximal point algorithm for minimax problems ⋮ Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems ⋮ Convergence analysis of processes with valiant projection operators in Hilbert space ⋮ Finite convergence of a subgradient projections method with expanding controls ⋮ A parallel implementation of the maximum likelihood method in positron emission tomography image reconstruction. ⋮ On a Family of Gradient-Type Projection Methods for Nonlinear Ill-Posed Problems ⋮ A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy ⋮ The \(\ell_1\) solution of linear inequalities ⋮ A row relaxation method for large minimax problems ⋮ Convergence of the cyclical relaxation method for linear inequalities ⋮ Iterative methods for solving consistent or inconsistent matrix inequality \({AXB} \geqslant C\) with linear constraints ⋮ On projective Landweber–Kaczmarz methods for solving systems of nonlinear ill-posed equations ⋮ Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ Linear Convergence of Projection Algorithms ⋮ Convergence properties of ART and SOR algorithms ⋮ Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem ⋮ An automatic relaxation method for solving interval linear inequalities ⋮ The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense ⋮ On stochastic Kaczmarz type methods for solving large scale systems of ill-posed equations ⋮ The adventures of a simple algorithm
Cites Work
This page was built for publication: A relaxation method for reconstructing objects from noisy X-rays