Non-monotoneous parallel iteration for solving convex feasibility problems.

MaRDI QIDQ5389724zbMATH OpenFDO

Authors Gilbert Crombez

Publication date 23 April 2012

Full work available at URL https://eudml.org/doc/33664, http://www.kybernetika.cz/content/2003/5/547

zbMATH Keywords

algorithmsconvex feasibility probleminherently parallel methodprojections onto convex setslow convergence

Mathematics Subject Classification ID

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

Recommendations

• Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
• Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
• A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems

Cites work

• Block-iterative surrogate projection methods for convex feasibility problems
• Decomposition through formalization in a product space
• scientific article; zbMATH DE number 1145160 (Why is no real title available?)
• scientific article; zbMATH DE number 1382772 (Why is no real title available?)
• scientific article; zbMATH DE number 806611 (Why is no real title available?)
• Improving the speed of convergence in the method of projections onto convex sets
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
• Strong convergence of expected-projection methods in hilbert spaces
• The method of projections for finding the common point of convex sets
• Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems

Cited in

(16)

• Convergence results for an accelerated nonlinear Cimmino algorithm
• Shuttle iterations in problems with nonmonotone nonlinearities.
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems
• Algorithms for the quasiconvex feasibility problem
• Improving the speed of convergence in the method of projections onto convex sets
• From parallel to sequential projection methods and vice versa in convex feasibility: Results and conjectures.
• Projection on the intersection of convex sets
• scientific article; zbMATH DE number 4209464 (Why is no real title available?)
• A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
• An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
• scientific article; zbMATH DE number 1174427 (Why is no real title available?)
• Convex feasibility modeling and projection methods for sparse signal recovery
• Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem

This page was built for publication: Non-monotoneous parallel iteration for solving convex feasibility problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389724)