A cyclic projection algorithm via duality (Q1123132): Difference between revisions

The paper studies the problem of finding the projection of a given point in a Hilbert space onto the intersection of finitely many closed convex sets. When looking at a dual problem, the procedure turns out to be the primal formulation of a classical method. In this way a natural explanation of the projection method and a simpler proof of its convergence are obtaining. Further investigations concern the asymptotic behaviour of dual quantities to be computed and convergence rates. Some numerical applications of these questions are given too.