Family constraining of iterative algorithms
From MaRDI portal
Publication:2249830
DOI10.1007/s11075-013-9736-5zbMath1297.65056arXiv1306.6145MaRDI QIDQ2249830
Yair Censor, Ioana Pantelimon, Constantin Popa
Publication date: 3 July 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.6145
algorithm; least squares problems; constraining strategy; fixed points set; image reconstrution from projections; strictly nonexpansive operators
65H10: Numerical computation of solutions to systems of equations
Related Items
Convergence of string-averaging method for a class of operators, Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings
Cites Work
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative selection methods for common fixed point problems
- Convergence of sequential and asynchronous nonlinear paracontractions
- Generalized inverses. Theory and applications.
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction
- Projection method for solving a singular system of linear equations and its applications
- On the asymptotic behavior of some alternate smoothing series expansion iterative methods
- Fundamentals of Computerized Tomography
- A general extending and constraining procedure for linear iterative methods
- Nested Iterative Algorithms for Convex Constrained Image Recovery Problems
- Contraining Strategies for Linear Iterative Processes
- Extended and constrained diagonal weighting algorithm with application to inverse problems in image reconstruction
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- On Projection Algorithms for Solving Convex Feasibility Problems
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
