Asymptotic behavior of two algorithms for solving common fixed point problems

DOI10.1088/1361-6420/33/4/044004zbMath1366.65057OpenAlexW2593751791MaRDI QIDQ5346623

Zaslavski, Alexander J.

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/044004

zbMATH Keywords

convergencefixed pointnonexpansive mappingHilbert spaceapproximate solutionst

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)

Related Items

On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Genericity in nonlinear analysis
• Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
• Image reconstruction from a small number of projections
• Perturbation resilience and superiorization of iterative algorithms
• Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction

This page was built for publication: Asymptotic behavior of two algorithms for solving common fixed point problems