A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space

DOI10.2307/2154816zbMath0832.47055OpenAlexW4241512786MaRDI QIDQ4846117

Heinz H. Bauschke

Publication date: 7 March 1996

Full work available at URL: https://doi.org/10.2307/2154816

zbMATH Keywords

nonexpansive mappingHilbert spaceconvex programmingcomputerized tomographyprojection methodconvex setrelaxation methodimage recoveryprojection algorithmimage reconstructionsignal processingorthogonal projectionfeasibility problemrelaxed projectionFejér monotone sequenceinnate bounded regularityKaczmarz's methodprojective mappingrandom productunrestricted iterationunrestricted productassumptions on compactness

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) General theory of numerical analysis in abstract spaces (65J05) Iterative procedures involving nonlinear operators (47J25) Biomedical imaging and signal processing (92C55) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative numerical methods for linear systems (65F10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Inner product spaces and their generalizations, Hilbert spaces (46C99)

Related Items

An alternating projection that does not converge in norm ⋮ Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ A convergence result on random products of mappings in metric spaces ⋮ Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence ⋮ Linear and strong convergence of algorithms involving averaged nonexpansive operators ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Outer Approximation Methods for Solving Variational Inequalities Defined over the Solution Set of a Split Convex Feasibility Problem ⋮ Alternating projections in CAT(0) spaces ⋮ There is no variational characterization of the cycles in the method of periodic projections ⋮ When products of projections diverge ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ Attracting mappings in Banach and hyperbolic spaces ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors ⋮ The set of divergent infinite products in a Banach space is \(\sigma\)-porous ⋮ A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed outer projections, weighted averages and convex feasibility
• On some optimization techniques in image reconstruction from projections
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Convergence of random products of compact contractions in Hilbert space
• Convergence of sequential and asynchronous nonlinear paracontractions
• An example concerning fixed points
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Random products of contractions in metric and Banach spaces
• Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings
• Unrestricted iterations of nonexpansive mappings in Hilbert space
• On the Convergence of the Products of Firmly Nonexpansive Mappings
• On Projection Algorithms for Solving Convex Feasibility Problems
• A necessary and sufficient condition for the convergence of a sequence of iterates for quasi-nonexpansive mappings
• Functional Operators (AM-22), Volume 2
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities