Convergence to approximate solutions and perturbation resilience of iterative algorithms

DOI10.1088/1361-6420/33/4/044005zbMath1456.47030OpenAlexW2592840662MaRDI QIDQ5346624

Zaslavski, Alexander J., Simeon Reich

Publication date: 26 May 2017

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/33/4/044005

zbMATH Keywords

fixed pointnonexpansive mappingHilbert spacemonotone operatorBanach spaceinexact orbitapproximate fixed point

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05) Fixed-point and coincidence theorems (topological aspects) (54H25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Special maps on metric spaces (54E40)

Related Items (3)

Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems ⋮ Derivative-free superiorization: principle and algorithm ⋮ Iterative methods for fixed points and zero points of nonlinear mappings with applications

Cites Work

• Invariant sets of nonexpansive mappings
• Approximate fixed points of nonexpansive mappings in unbounded sets
• Two porosity theorems for nonexpansive mappings in hyperbolic spaces
• Monotone (nonlinear) operators in Hilbert space
• Convergence and perturbation resilience of dynamic string-averaging projection methods
• Projected subgradient minimization versus superiorization
• Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
• On the monotonicity of the gradient of a convex function
• Genericity in nonlinear analysis
• The set of noncontractive mappings is -porous in the space of all nonexpansive mappings
• Perturbation resilience and superiorization of iterative algorithms
• On Projection Algorithms for Solving Convex Feasibility Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convergence to approximate solutions and perturbation resilience of iterative algorithms