Iterations of parallel convex projections in hilbert spaces

DOI10.1080/01630569408816563zbMath0814.46064OpenAlexW2075184278MaRDI QIDQ4296720

Patrick L. Combettes, Hong Puh

Publication date: 19 June 1994

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

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

zbMATH Keywords

iterative procedurecommon point of closed and convex sets in a Hilbert space

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items

A parallel projection method based on sequential most remote set in convex feasibility problems ⋮ Solving stochastic convex feasibility problems in hilbert spaces ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\)

Cites Work

• Unnamed Item
• A simultaneous projections method for linear inequalities
• Method of successive projections for finding a common point of sets in metric spaces
• Convergence results for an accelerated nonlinear Cimmino algorithm
• Strong convergence of projection-like methods in Hilbert spaces
• Weak convergence theorems for nonexpansive mappings in Banach spaces
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• Image recovery by convex combinations of projections
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• A limit theorem for projections
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Estimation of the parameters of a multipath channel using set-theoretic deconvolution
• The method of projections for finding the common point of convex sets
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities