Strong Convergence in Hilbert Spaces via Gamma-Duality
Jefferson Melo | Marques Alves, Maicon
duality - strong convergence - Hilbert Spaces - Convex Feasibility
We analyze a primal-dual pair of problems generated via a duality theory introduced by Svaiter. We propose a general algorithm and study its convergence properties. The focus is a general primal-dual principle for strong convergence of some classes of algorithms. In particular, we give a diferent viewpoint for the weak-to-strong principle of Bauschke and Combettes and unify many results concerning weak and strong convergence of subgradient type methods.