The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
type: Item
instance of: scholarly article
title: The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
zbMATH Open document ID: 1504.47108
published in: Numerical Algorithms
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 47J25
Mathematics Subject Classification ID: 47H09
zbMATH DE Number: 7602919
zbMATH Keywords: Hilbert space
zbMATH Keywords: inexact product
zbMATH Keywords: infinite product
zbMATH Keywords: nonexpansive mapping
zbMATH Keywords: projection
author: Alexander J. Zaslavski
MaRDI profile type: Publication
full work available at URL: s11075-022-01308-9
OpenAlex ID: W4224227967
cites work: Finding a best approximation pair of points for two polyhedra
cites work: Q4179429
cites work: The composition of projections onto closed convex sets in Hilbert space is asymptotically regular
cites work: On the convergence of von Neumann's alternating projection algorithm for two sets
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Q4336949
cites work: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
cites work: Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
cites work: Q4163944
cites work: Asymptotic Behavior of Inexact Orbits for a Class of Operators in Complete Metric Spaces
cites work: Steered sequential projections for the inconsistent convex feasibility problem
cites work: Strong underrelaxation in Kaczmarz's method for inconsistent systems
cites work: Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
cites work: Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review
cites work: Proximity Maps for Convex Sets
cites work: Hard-constrained inconsistent signal feasibility problems
cites work: Best approximation in inner product spaces
cites work: Q4589178
cites work: Q3322631
cites work: Q5583429
cites work: Optimization for Inconsistent Split Feasibility Problems
cites work: Q4660006
cites work: A note on alternating projections in Hilbert space
cites work: Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
cites work: Q5445188
cites work: Q4464219
cites work: Extension problems for accretive sets in Banach spaces
cites work: Projection algorithms for solving the split feasibility problem with multiple output sets
cites work: A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
cites work: Genericity in nonlinear analysis
cites work: Q5144129
cites work: Q5146233
cites work: Q5151657
cites work: Iterative methods for generalized split feasibility problems in Hilbert spaces
cites work: Approximate solutions of common fixed-point problems
cites work: Algorithms for solving common fixed point problems
DOI: 10.1007/S11075-022-01308-9
description: scientific article; zbMATH DE number 7602919