scientific article

zbMath0571.90068MaRDI QIDQ3688107

Yair Censor

Publication date: 1984

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

zbMATH Keywords

convex feasibility problemfinding a pointintersection of a finite family of closed convex sets

Mathematics Subject Classification ID

Convex programming (90C25) Linear inequalities of matrices (15A39) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items

Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, On some optimization techniques in image reconstruction from projections, The Douglas-Rachford algorithm for convex and nonconvex feasibility problems, An acceleration scheme for cyclic subgradient projections method, Extrapolation algorithm for affine-convex feasibility problems, Relaxed outer projections, weighted averages and convex feasibility, Algorithms for the quasiconvex feasibility problem, An automatic relaxation method for solving interval linear inequalities, Cyclic subgradient projections