Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem

DOI10.1137/0803046MaRDI QIDQ4277518zbMATH OpenOpenAlexFDO

Authors Ubaldo M. García-Palomares

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

zbMATH Keywords

convex feasibility problemparallel processingconvergence conditionsmultiprocessingprojected aggregation methodsconvex systemsconvex subdifferentiable functions

Mathematics Subject Classification ID

Convex programming (90C25) Parallel numerical computation (65Y05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex functions and convex programs in convex geometry (52A41)

Recommendations

• A parallel subgradient projections method for the convex feasibility problem
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• scientific article; zbMATH DE number 16987
• From parallel to sequential projection methods and vice versa in convex feasibility: Results and conjectures.
• New optimized and accelerated PAM methods for solving large non-symmetric linear systems: Theory and practice

Cited in

(15)

• A class of optimized row projection methods for solving large nonsymmetric linear systems
• A superlinearly convergent projection algorithm for solving the convex inequality problem
• An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
• Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
• An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem
• New optimized and accelerated PAM methods for solving large non-symmetric linear systems: Theory and practice
• On the incomplete oblique projections method for solving box constrained least squares problems
• Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
• Incomplete oblique projections for solving large inconsistent linear systems
• scientific article; zbMATH DE number 741199 (Why is no real title available?)
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
• scientific article; zbMATH DE number 16987 (Why is no real title available?)
• An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
• Extrapolation algorithm for affine-convex feasibility problems
• Block-iterative surrogate projection methods for convex feasibility problems

This page was built for publication: Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277518)