scientific article
From MaRDI portal
Publication:3028739
zbMath0625.90079MaRDI QIDQ3028739
Leonardo Moledo, Alfredo Noel Iusem
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel processorsconvex feasibility problemconvex inequalitiesrow-action methodsimultaneous subgradient projections method
Nonlinear programming (90C30) Linear inequalities of matrices (15A39) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems ⋮ On finitely convergent iterative methods for the convex feasibility problem ⋮ Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment ⋮ Convex feasibility modeling and projection methods for sparse signal recovery ⋮ Generalization: One technique of computational and applied mathematical methodology ⋮ A method for approximating the solution set of a system of convex inequalities by polytopes ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Finitely convergent iterative methods with overrelaxations revisited ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ On the finite convergence of a projected cutter method