Answers are grounded in this paper and cite their sources.
In this article, we propose a strongly convergent variant on the projected subgradient method for constrained convex minimization problems in Hilbert spaces. The advantage of the proposed method is that it converges strongly when the problem has solutions, without additional assumptions. The method also has the following desirable property: the sequence converges to the solution of the problem which lies closest to the initial iterate.
No takes yet. Share an insight, caveat, or question.
Bello-Cruz et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: