A parallel projection method based on sequential most remote set in convex feasibility problems

DOI10.1016/0096-3003(94)00177-6zbMath0840.65039OpenAlexW2065839865MaRDI QIDQ1907078

Gilbert Crombez

Publication date: 30 June 1996

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(94)00177-6

zbMATH Keywords

linear programmingHilbert spaceconvex feasibility problemsparallel projection methodclosed convex setscommon point of setsmost remote setsequential projection method

Mathematics Subject Classification ID

Convex programming (90C25) General theory of numerical analysis in abstract spaces (65J05) Programming in abstract spaces (90C48) Parallel numerical computation (65Y05)

Related Items

Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems

Cites Work

• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Weak and norm convergence of a parallel projection method in Hilbert spaces
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Iterations of parallel convex projections in hilbert spaces
• Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
• The method of projections for finding the common point of convex sets