Convergence and perturbation resilience of dynamic string-averaging projection methods

  title={Convergence and perturbation resilience of dynamic string-averaging projection methods},
  author={Yair Censor and Alexander J. Zaslavski},
  journal={Computational Optimization and Applications},
  • Y. Censor, A. Zaslavski
  • Published 1 June 2012
  • Mathematics, Computer Science, Physics
  • Computational Optimization and Applications
We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence and their perturbation resilience. In the past, SAP methods were formulated with a single predetermined set of strings and a single predetermined set of weights. Here we extend the scope of the family of SAP methods to allow iteration-index-dependent variable strings and weights and term such methods dynamic string… 
Perturbation resilience and superiorization methodology of averaged mappings
We first prove the bounded perturbation resilience for the successive fixed point algorithm of averaged mappings, which extends the string-averaging projection and block-iterative projection methods.
Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
Bounded perturbation resilience and superiorization techniques for the projected scaled gradient (PSG) method are studied under the general Hilbert space setting. Weak convergence results of the
Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings
We study a perturbation-resilient iterative method with an infinite pool of operators having a property, which allows using discontinuous operators, weaker than paracontracting. A convergence result
Bounded Perturbation Resilience of Two Modified Relaxed CQ Algorithms for the Multiple-Sets Split Feasibility Problem
In this paper, we present some modified relaxed CQ algorithms with different kinds of step size and perturbation to solve the Multiple-sets Split Feasibility Problem (MSSFP). Under mild assumptions,
Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
The main result indicates that the convergence rate of unperturbed products is essentially preserved in the presence of perturbations, which applies to the linear converge rate of dynamic string-averaging projection methods, which is established here as well.
Bounded perturbation resilience of projected scaled gradient methods
This work proves the convergence of the PSG methods in the presence of bounded perturbations, which is relevant to the ability to apply the recently developed superiorization methodology to PSg methods, in particular to the EM algorithm.
Bounded Perturbation Resilience and Superiorization of Proximal Scaled Gradient Algorithm with Multi-Parameters
In this paper, a multi-parameter proximal scaled gradient algorithm with outer perturbations is presented in real Hilbert space. The strong convergence of the generated sequence is proved. The
Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
A modified proximal gradient algorithm with outer perturbations in Hilbert space is introduced and it is proved that the algorithm converges strongly to a solution of the composite optimization problem.
Perturbation resilience of proximal gradient algorithm for composite objectives
In this paper, we study the perturbation resilience of a proximal gradient algorithm under the general Hilbert space setting. With the assumption that the error sequence is summable, we prove that
String-averaging projected subgradient methods for constrained minimization
An algorithmic scheme is proposed that generalizes, from the algorithmic structural point of view, earlier work of Helou Neto and De Pierro, and uses the recently developed family of dynamic string-averaging projection methods wherein iteration-index-dependent variable strings and variable weights are permitted.


Stable Convergence Behavior Under Summable Perturbations of a Class of Projection Methods for Convex Feasibility and Optimization Problems
It is proved that the algorithms in this class of projection methods converge to solutions of the consistent convex feasibility problem, and that their convergence is stable under summable perturbations.
Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
An algorithmic scheme is proposed which genenralizes both the string-averaging algorithm and the block-iterative projections (BIP) method with fixed blocks and proves convergence of the Stringaveraging method in the inconsistent case by translating it into a fully sequential algorithm in the product space.
Averaging Strings of Sequential Iterations for Convex Feasibility Problems
An algorithmic scheme for the solution of convex feasibility problems is proposed in which the end-points of strings of sequential projections onto the constraints are averaged. The scheme employing
Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
A block-iterative projection algorithm for solving the consistent convex feasibility problem in a finite-dimensional Euclidean space that is resilient to bounded and summable perturbations (in the
Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction.
The accelerated algorithms are illustrated to be better, in a strict sense provided by the method of statistical hypothesis testing, than their unaccelerated versions for the task of detecting small tumors in the brain from X-ray CT projection data.
Perturbation Resilience and Superiorization of Iterative Algorithms
A methodology is presented whose aim is to produce automatically for an iterative algorithm of the first kind a "superiorized version" of it that retains its computational efficiency but nevertheless goes a long way towards solving an optimization problem.
On the string averaging method for sparse common fixed-point problems
A definition of sparseness of a family of operators is proposed and a string-averaging algorithmic scheme is investigated that favorably handles the common fixed points problem when the family of Operators is sparse.
On String-Averaging for Sparse Problems and On the Split Common Fixed Point Problem
We review the common fixed point problem for the class of directed operators. This class is important because many commonly used nonlinear operators in convex optimization belong to it. We present
Solving monotone inclusions via compositions of nonexpansive averaged operators
A unified fixed point theoretic framework is proposed to investigate the asymptotic behavior of algorithms for finding solutions to monotone inclusion problems. The basic iterative scheme under
Projection and proximal point methods: convergence results and counterexamples
Recently, Hundal has constructed a hyperplane H , a cone K, and a starting point y0 in ‘2 such that the sequence of alternating projections ((PK PH ) n y0)n∈N converges weakly to some point in H ∩ K,