On the behavior of a block-iterative projection method for solving convex feasibility problems
From MaRDI portal
Publication:3491319
DOI10.1080/00207169008803865zbMath0708.90064MaRDI QIDQ3491319
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
relaxation method; parallel implementations; convex feasibility problem; orthogonal projection operator; block-iterative projection; convergent theorem
65K05: Numerical mathematical programming methods
90C25: Convex programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
68W15: Distributed algorithms
Related Items
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, Strong convergence of expected-projection methods in hilbert spaces, Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems, A method for approximating the solution set of a system of convex inequalities by polytopes, A superlinearly convergent projection algorithm for solving the convex inequality problem, On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space, 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, About strongly Fejér monotone mappings and their relaxations, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, A parallel projection method based on sequential most remote set in convex feasibility problems, Weak and norm convergence of a parallel projection method in Hilbert spaces
