Incomplete projection algorithms for solving the convex feasibility problem

DOI10.1023/A:1019165330848zbMath0913.65146OpenAlexW1644034812MaRDI QIDQ1275443

Francisco J. González-Castaño, Ubaldo M. García-Palomares

Publication date: 10 March 1999

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019165330848

zbMATH Keywords

convergenceconvergence accelerationnumerical testsconvex feasibility problemmultiprocessingincomplete projection algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS ⋮ Convergence analysis of a parallel projection algorithm for solving convex feasibility problems ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems