Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
From MaRDI portal
Publication:679708
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)
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.
Recommendations
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Perturbation resilience and superiorization methodology of averaged mappings
- scientific article; zbMATH DE number 6285845
- Perturbation-resilient iterative methods with an infinite pool of mappings
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
Cites work
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 3301853 (Why is no real title available?)
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- AN EXAMPLE CONCERNING BOUNDED LINEAR REGULARITY OF SUBSPACES IN HILBERT SPACE
- Averaging strings of sequential iterations for convex feasibility problems.
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Compositions and convex combinations of averaged nonexpansive operators
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition through formalization in a product space
- Error bounds for the method of alternating projections
- Fundamentals of Computerized Tomography
- Image reconstruction from a small number of projections
- Inner inclination of subspaces and infinite products of orthogonal projections
- Iterative methods for fixed point problems in Hilbert spaces
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- On Projection Algorithms for Solving Convex Feasibility Problems
- Perturbation resilience and superiorization of iterative algorithms
- Porosity and the bounded linear regularity property
- Projected subgradient minimization versus superiorization
- Projection algorithms: Results and open problems
- Properties of a class of approximately shrinking operators and their applications
- Quasi-Fejérian analysis of some optimization algorithms
- Reconstruction from a few projections by \(\ell _{1}\)-minimization of the Haar transform
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- 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. 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
- The rate of convergence in the method of alternating projections
- Theory of Reproducing Kernels
- Weak and strong superiorization: between feasibility-seeking and minimization
- Weak, strong, and linear convergence of a double-layer fixed point algorithm
Cited in
(18)- Optimization for the sum of finite functions over the solution set of split equality optimization problems with applications
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
- String-averaging algorithms for convex feasibility with infinitely many sets
- Perturbation resilience and superiorization methodology of averaged mappings
- Derivative-free superiorization: principle and algorithm
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- scientific article; zbMATH DE number 6285845 (Why is no real title available?)
- Nesterov perturbations and projection methods applied to IMRT
- String-averaging incremental stochastic subgradient algorithms
- Inexact infinite products of weak quasi-contraction mappings in \(b\)-metric spaces
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- Multi-channel Potts-based reconstruction for multi-spectral computed tomography
- Polynomial estimates for the method of cyclic projections in Hilbert spaces
- Deep neural network structures solving variational inequalities
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Linear convergence rates for extrapolated fixed point algorithms
- 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)
