Strong convergence of expected-projection methods in hilbert spaces

DOI10.1080/01630569508816635zbMath0834.65041MaRDI QIDQ4845180

Dan Butnariu, Sjur Didrik Flåm

Publication date: 18 October 1995

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569508816635

zbMATH Keywords

strong convergence; Hilbert spaces; projection methods; computational tomography; stochastic convex feasibility problems; best-approximation problems; stochastic systems of convex inequalities

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

65J05: General theory of numerical analysis in abstract spaces

90C15: Stochastic programming

92C55: Biomedical imaging and signal processing

41A50: Best approximation, Chebyshev systems

47H40: Random nonlinear operators

Related Items

Random Function Iterations for Consistent Stochastic Feasibility, Non-Convex feasibility problems and proximal point methods, Unnamed Item, Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem, A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces, Unnamed Item, The method of randomized Bregman projections for stochastic feasibility problems, Hilbertian convex feasibility problem: Convergence of projection methods, An estimate for Lipschitz constants of metric projections, Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces, Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems, Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed outer projections, weighted averages and convex feasibility
• Convergence results for an accelerated nonlinear Cimmino algorithm
• Strong convergence of projection-like methods in Hilbert spaces
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Error bounds for the method of alternating projections
• Convex analysis and measurable multifunctions
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Convergence of convex sets and of solutions of variational inequalities
• Iterative methods for best approximate solutions of linear integral equations of the first and second kinds
• On rings of operators. Reduction theory
• On the factorization of matrices
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Decomposition through formalization in a product space
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On the non-polynomiality of the relaxation method for systems of linear inequalities
• Lagrange Multipliers in Stochastic Programming
• On the Convergence of the Products of Firmly Nonexpansive Mappings
• Generalized Image Restoration by the Method of Alternating Orthogonal Projections
• On systems of inequalities with convex functions in the left sides
• The method of projections for finding the common point of convex sets
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Set-valued analysis