General perturbation resilient dynamic string-averaging for inconsistent problems with superiorization
approximately shrinking operatorbounded perturbation resiliencebounded regularitycoherencecoherent sequence of operatorscommon fixed point problemconvex feasibility problemdynamic string-averagingFejér monotonicitymetric projectionnonexpansive operatorstrong coherencestrongly coherent sequence of operatorssuperiorizationweak convergenceweak regularity
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Iterative numerical methods for linear systems (65F10) Numerical analysis in abstract spaces (65J99)
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Algorithms and convergence results of projection methods for inconsistent feasibility problems: a review
- Averaging strings of sequential iterations for convex feasibility problems.
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence of string-averaging method for a class of operators
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- 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
- scientific article; zbMATH DE number 7416599 (Why is no real title available?)
- Iterative methods for fixed point problems in Hilbert spaces
- Linear convergence rates for extrapolated fixed point algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Opial-type theorems and the common fixed point problem
- Preface: Superiorization: theory and applications
- Properties of a class of approximately shrinking operators and their applications
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- String-averaging algorithms for convex feasibility with infinitely many sets
- String-averaging incremental stochastic subgradient algorithms
- Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
- The generalized modular string averaging procedure and its applications to iterative methods for solving various nonlinear operator theory problems
- Weak and strong superiorization: between feasibility-seeking and minimization
- A new theorem of alternatives leading to sufficient conditions for the superiorization guarantee question of Dynamic String-Averaging in the inconsistent case
- A new theorem of alternatives leading to sufficient conditions for the superiorization guarantee question of dynamic string-averaging in the inconsistent case
This page was built for publication: General perturbation resilient dynamic string-averaging for inconsistent problems with superiorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946629)
