On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- 17 March 2011
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 51 (3) , 1065-1088
Abstract
No abstract availableKeywords
This publication has 67 references indexed in Scilit:
- Perturbation resilience and superiorization of iterative algorithmsInverse Problems, 2010
- Efficient controls for finitely convergent sequential algorithmsACM Transactions on Mathematical Software, 2010
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projectionsInternational Transactions in Operational Research, 2009
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapyLinear Algebra and its Applications, 2008
- How good are projection methods for convex feasibility problems?Computational Optimization and Applications, 2007
- Mesh watermarking based projection onto two convex setsMultimedia Systems, 2007
- Projection and proximal point methods: convergence results and counterexamplesNonlinear Analysis, 2004
- Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projectionsIEEE Transactions on Image Processing, 1997
- On the behavior of a block-iterative projection method for solving convex feasibility problemsInternational Journal of Computer Mathematics, 1990
- Algebraic Reconstruction Techniques (ART) for three-dimensional electron microscopy and X-ray photographyJournal of Theoretical Biology, 1970