Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
From MaRDI portal
Publication:4277518
DOI10.1137/0803046zbMath0791.90042OpenAlexW2082387112MaRDI QIDQ4277518
Publication date: 7 February 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0803046
parallel processingconvex feasibility problemconvergence conditionsmultiprocessingprojected aggregation methodsconvex systemsconvex subdifferentiable functions
Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Inequalities and extremum problems involving convexity in convex geometry (52A40) Parallel numerical computation (65Y05)
Related Items
Block-iterative surrogate projection methods for convex feasibility problems, On the incomplete oblique projections method for solving box constrained least squares problems, Convergence analysis of a parallel projection algorithm for solving convex feasibility problems, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Incomplete oblique projections for solving large inconsistent linear systems, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Extrapolation algorithm for affine-convex feasibility problems, A superlinearly convergent projection algorithm for solving the convex inequality problem, An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems, A class of optimized row projection methods for solving large nonsymmetric linear systems
