From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation

摘要

We describe the evolution of projection methods for solving convex feasibility problems to optimizationmethods when inconsistency arises, finally deriving from them, in a natural way, a general block method forconvex constrained optimization. We present convergence results.