Publication:3028739
From MaRDI portal
zbMath0625.90079MaRDI QIDQ3028739
Alfredo Noel Iusem, Leonardo Moledo
Publication date: 1986
parallel processors; convex feasibility problem; convex inequalities; row-action method; simultaneous subgradient projections method
90C30: Nonlinear programming
15A39: Linear inequalities of matrices
52A40: Inequalities and extremum problems involving convexity in convex geometry
Related Items
Convex feasibility modeling and projection methods for sparse signal recovery, Hilbertian convex feasibility problem: Convergence of projection methods, Generalization: One technique of computational and applied mathematical methodology, A method for approximating the solution set of a system of convex inequalities by polytopes, On finitely convergent iterative methods for the convex feasibility problem