科研之友
微信
新浪微博
Facebook
分享链接
摘要
It is well known that the gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this article, we first provide an alternative averaged mapping approach to the GPA. This approach is operator-oriented in nature. Since, in general, in infinite-dimensional Hilbert spaces, GPA has only weak convergence, we provide two modifications of GPA so that strong convergence is guaranteed. Regularization is also applied to find the minimum-norm solution of the minimization problem under investigation.
- 出版日期2011-8
- 单位中山大学
