Convergence and perturbation resilience of dynamic string-averaging projection methods
Open Access
- 13 June 2012
- journal article
- Published by Springer Science and Business Media LLC in Computational Optimization and Applications
- Vol. 54 (1), 65-76
- https://doi.org/10.1007/s10589-012-9491-x
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Iterative Methods for Fixed Point Problems in Hilbert SpacesPublished by Springer Science and Business Media LLC ,2013
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraintsComputational Optimization and Applications, 2011
- Convex Analysis and Monotone Operator Theory in Hilbert SpacesPublished by Springer Science and Business Media LLC ,2011
- Perturbation resilience and superiorization of iterative algorithmsInverse Problems, 2010
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive MappingsNumerical Functional Analysis and Optimization, 2008
- Stable Convergence Behavior Under Summable Perturbations of a Class of Projection Methods for Convex Feasibility and Optimization ProblemsIEEE Journal of Selected Topics in Signal Processing, 2007
- Projection and proximal point methods: convergence results and counterexamplesNonlinear Analysis, 2004
- Averaging Strings of Sequential Iterations for Convex Feasibility ProblemsPublished by Elsevier BV ,2001
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problemsLinear Algebra and its Applications, 1989