Iterative methods for constrained convex minimization problem in Hilbert spaces

作者：Tian Ming^*; Huang Li Hua

来源：Fixed Point Theory and Applications, 2013, 2013(1): 105.

DOI：10.1186/1687-1812-2013-105

• iterative algorithm
• constrained convex minimization
• nonexpansive mapping
• fixed point
• variational inequality

In this paper, based on Yamada's hybrid steepest descent method, a general iterative method is proposed for solving constrained convex minimization problem. It is proved that the sequences generated by proposed implicit and explicit schemes converge strongly to a solution of the constrained convex minimization problem, which also solves a certain variational inequality.

• 出版日期2013
• 单位中国民航大学