On the behavior of a block-iterative projection method for solving convex feasibility problems

DOI10.1080/00207169008803865zbMath0708.90064OpenAlexW1979948370MaRDI QIDQ3491319

Dan Butnariu, Yair Censor

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

relaxation methodparallel implementationsconvex feasibility problemorthogonal projection operatorblock-iterative projectionconvergent theorem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items

Weak and norm convergence of a parallel projection method in Hilbert spaces, Opial-Type Theorems and the Common Fixed Point Problem, Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces, A multiprojection algorithm using Bregman projections in a product space, Block-iterative surrogate projection methods for convex feasibility problems, PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS, A parallel projection method based on sequential most remote set in convex feasibility problems, About strongly Fejér monotone mappings and their relaxations, Strong convergence of expected-projection methods in hilbert spaces, Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces, A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints, Projection methods for the linear split feasibility problems, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization, Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters, A method for approximating the solution set of a system of convex inequalities by polytopes, Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces, Strong convergence of a self-adaptive method for the split feasibility problem, Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems, Extrapolation algorithm for affine-convex feasibility problems, A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets, New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses, Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, A superlinearly convergent projection algorithm for solving the convex inequality problem, On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space, Unnamed Item, A generalized block-iterative projection method for the common fixed point problem induced by cutters

Cites Work

• Unnamed Item
• A simultaneous projections method for linear inequalities
• Convergence results for an accelerated nonlinear Cimmino algorithm
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• New methods for linear inequalities
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Convergence of the cyclical relaxation method for linear inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• The method of projections for finding the common point of convex sets
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities