Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem

Fixexd point theory and applications

Ming Tian¹  Lei Liu¹ 

[1] College of Science, Civil Aviation University of China, Tianjin, China

关键词: iterative algorithm;    equilibrium problem;    constrained convex minimization;    variational inequality;   

DOI  :  10.1186/1687-1812-2012-201

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

The gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. Based on the viscosity approximation method, we combine the GPA and averaged mapping approach to propose implicit and explicit composite iterative algorithms for finding a common solution of an equilibrium and a constrained convex minimization problem for the first time in this paper. Under suitable conditions, strong convergence theorems are obtained. MSC:46N10, 47J20, 74G60.

【 授权许可】

CC BY