Convergence and perturbation resilience of dynamic string-averaging projection methods

DOI10.1007/s10589-012-9491-xzbMath1285.90079arXiv1206.0129OpenAlexW2109982246MaRDI QIDQ1938920

Yair Censor, Zaslavski, Alexander J.

Publication date: 25 February 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.0129

zbMATH Keywords

fixed point Hilbert space projection methods metric projection nonexpansive operator perturbation resilience variable weights dynamic string-averaging superiorization method variable strings

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Related Items

Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Feasibility-based fixed point networks ⋮ Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings ⋮ Asymptotic Behavior of Iterates of a Generic Cyclical Nonexpansive Mapping ⋮ Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings ⋮ A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators ⋮ Asymptotic behavior of two algorithms for solving common fixed point problems ⋮ Convergence to approximate solutions and perturbation resilience of iterative algorithms ⋮ Can linear superiorization be useful for linear optimization problems? ⋮ Perturbation resilience and superiorization methodology of averaged mappings ⋮ Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method ⋮ Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem ⋮ Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications ⋮ Bounded perturbation resilience of viscosity proximal algorithm for solving split variational inclusion problems with applications to compressed sensing and image recovery ⋮ CONVERGENCE OF INEXACT ITERATES OF UNIFORMLY LOCALLY NONEXPANSIVE MAPPINGS WITH SUMMABLE ERRORS ⋮ Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation ⋮ Outer approximation methods for solving variational inequalities in Hilbert space ⋮ Unnamed Item ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ String-averaging incremental stochastic subgradient algorithms ⋮ Decomposition in derivative-free optimization ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ Perturbation resilience of proximal gradient algorithm for composite objectives ⋮ String-averaging projected subgradient methods for constrained minimization ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Bounded perturbation resilience of projected scaled gradient methods ⋮ An analysis of the superiorization method via the principle of concentration of measure ⋮ Convergence of string-averaging method for a class of operators ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods

Cites Work