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

Álvaro Rodolfo De Pierro, Elias S. Helou · International Transactions in Operational Research · 2009

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

Read the paper · More papers on PaperTik