Convergence properties of dynamic string-averaging projection methods in the presence of perturbations

DOI10.1007/S11075-017-0310-4zbMath1459.47023arXiv1703.07803OpenAlexW2598135565MaRDI QIDQ679708

Simeon Reich, Christian Bargetz, Rafał Zalas

Publication date: 19 January 2018

Published in: Numerical Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

strong convergenceweak convergenceperturbation resiliencestring averaginglinear ratesuperiorisation

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Perturbations of nonlinear operators (47H14)

Related Items (15)

String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Polynomial estimates for the method of cyclic projections in Hilbert spaces ⋮ On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions ⋮ Deep neural network structures solving variational inequalities ⋮ Inexact Infinite Products of Weak Quasi-Contraction Mappings in b-Metric Spaces ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ Optimization for the sum of finite functions over the solution set of split equality optimization problems with applications ⋮ String-averaging incremental stochastic subgradient algorithms ⋮ Regular Sequences of Quasi-Nonexpansive Operators and Their Applications ⋮ Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy ⋮ Nesterov perturbations and projection methods applied to IMRT ⋮ Derivative-free superiorization: principle and algorithm ⋮ Multi-channel Potts-based reconstruction for multi-spectral computed tomography ⋮ Regularization by Denoising via Fixed-Point Projection (RED-PRO)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
• Iterative methods for fixed point problems in Hilbert spaces
• Compositions and convex combinations of averaged nonexpansive operators
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• Error bounds for the method of alternating projections
• Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
• Convergence and perturbation resilience of dynamic string-averaging projection methods
• Porosity and the bounded linear regularity property
• Projected subgradient minimization versus superiorization
• Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
• Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
• Fundamentals of Computerized Tomography
• Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
• The rate of convergence in the method of alternating projections
• Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
• Reconstruction from a few projections by ℓ ₁ -minimization of the Haar transform
• Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
• Image reconstruction from a small number of projections
• Perturbation resilience and superiorization of iterative algorithms
• Decomposition through formalization in a product space
• Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
• AN EXAMPLE CONCERNING BOUNDED LINEAR REGULARITY OF SUBSPACES IN HILBERT SPACE
• Theory of Reproducing Kernels
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Convergence properties of dynamic string-averaging projection methods in the presence of perturbations