scientific article; zbMATH DE number 1894728

zbMath1039.47044MaRDI QIDQ4801805

Gilbert Crombez

Publication date: 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

iterative algorithmcommon fixed pointsconvex feasibility problemsparacontractions

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items (13)

A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Subgradient projection algorithms and approximate solutions of convex feasibility problems ⋮ Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications ⋮ Convergence and perturbation resilience of dynamic string-averaging projection methods ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ On the string averaging method for sparse common fixed‐point problems ⋮ Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections ⋮ Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods

This page was built for publication: