scientific article; zbMATH DE number 6026954

zbMath1249.65040MaRDI QIDQ5389724

Gilbert Crombez

Publication date: 23 April 2012

Full work available at URL: https://eudml.org/doc/33664

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsconvex feasibility problemslow convergenceinherently parallel methodprojections onto convex set

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05)

Related Items (4)

Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ Convex feasibility modeling and projection methods for sparse signal recovery ⋮ Non-monotonous sequential subgradient projection algorithm for convex feasibility problem ⋮ Algorithms for the quasiconvex feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Block-iterative surrogate projection methods for convex feasibility problems
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Decomposition through formalization in a product space
• Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
• On Projection Algorithms for Solving Convex Feasibility Problems
• Strong convergence of expected-projection methods 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

This page was built for publication: