Strong Convergence in Hilbert Spaces via Γ-Duality
- 239 Downloads
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 different viewpoint for the weak-to-strong principle of Bauschke and Combettes and unify many results concerning weak and strong convergence of subgradient type methods.
KeywordsΓ-Duality Hilbert spaces Convex feasibility Strong convergence Subgradient method
This work was completed while the first author was visiting the Institute of Mathematics and Statistics at the University of Goias, whose warm hospitality is gratefully acknowledged. The authors thank Dr. Benar Fux Svaiter for bringing this problem to our attention, for sending us a copy of  and  as well as for the criticism concerning the first version of this manuscript. The authors also thank the two anonymous referees and the editor for their valuable comments.
M. Marques Alves is partially supported by CNPq grants 305414/2011-9 and 479729/2011-5 and PRONEX-Optimization. J.G. Melo is Partially supported by Procad/NF and by PRONEX-Optimization.
- 11.Svaiter, B.F.: Uma nova abordagem para dualidade em programação não linear e aplicações. Ph.D. Thesis, IMPA (1994) Google Scholar
- 14.Fan, Ky.: On systems of linear inequalities. Linear inequalities and related systems. In: Annals of Math. Studies, vol. 38, pp. 99–156. Princeton University Press, New Jersey (1956) Google Scholar