General iterative scheme based on the regularization for solving a constrained convex minimization problem

Journal of inequalities and applications

Ming Tian¹ 

关键词: averaged mapping;    gradient-projection algorithm;    constrained convex minimization;    regularization;    split feasibility problem;    variational inequality;   

DOI  :  10.1186/1029-242X-2013-550

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

It is well known that the regularization method plays an important role in solving a constrained convex minimization problem. In this article, we introduce implicit and explicit iterative schemes based on the regularization for solving a constrained convex minimization problem. We establish results on the strong convergence of the sequences generated by the proposed schemes to a solution of the minimization problem. Such a point is also a solution of a variational inequality. We also apply the algorithm to solve a split feasibility problem. MSC:47H09, 47H05, 47H06, 47J25, 47J05.

【 授权许可】

CC BY