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

DOI10.1007/S11075-017-0310-4zbMATH Open1459.47023arXiv1703.07803OpenAlexW2598135565MaRDI QIDQ679708FDOQ679708

Simeon Reich, Christian Bargetz, Rafał Zalas

Publication date: 19 January 2018

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

Abstract: Assuming that the absence of perturbations guarantees weak or strong convergence to a common fixed point, we study the behavior of perturbed products of an infinite family of nonexpansive operators. Our main result indicates that the convergence rate of unperturbed products is essentially preserved in the presence of perturbations. This, in particular, applies to the linear convergence rate of dynamic string averaging projection methods, which we establish here as well. Moreover, we show how this result can be applied to the superiorization methodology.

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

zbMATH Keywords

weak convergencestrong convergenceperturbation resiliencestring averaginglinear ratesuperiorisation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Error bounds for the method of alternating projections
• Fundamentals of Computerized Tomography
• On Projection Algorithms for Solving Convex Feasibility Problems
• Theory of Reproducing Kernels
• Convex analysis and monotone operator theory in Hilbert spaces
• Weak and strong superiorization: between feasibility-seeking and minimization
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
• Inner inclination of subspaces and infinite products of orthogonal projections
• The rate of convergence in the method of alternating projections
• Iterative methods for fixed point problems in Hilbert spaces
• Quasi-Fejérian analysis of some optimization algorithms
• Image reconstruction from a small number of projections
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Porosity and the bounded linear regularity property
• Decomposition through formalization in a product space
• Convergence and perturbation resilience of dynamic string-averaging projection methods
• Averaging strings of sequential iterations for convex feasibility problems.
• Properties of a class of approximately shrinking operators and their applications
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
• Perturbation resilience and superiorization of iterative algorithms
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
• Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
• Compositions and convex combinations of averaged nonexpansive operators
• Projected subgradient minimization versus superiorization
• Projection algorithms: Results and open problems
• Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
• Reconstruction from a few projections by ℓ ₁ -minimization of the Haar transform
• Convergence rate analysis and error bounds for projection algorithms in 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

Cited In (16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679708)