Conversion of algorithms by releasing projection for minimization problems

Fixexd point theory and applications

Yeong-Cheng Liou¹  Shin Min Kang²  Yonghong Yao³ 

[1] Department of Information Management, Cheng Shiu University, Kaohsiung, Taiwan;Department of Mathematics and the RINS, Gyeongsang National University, Jinju, Korea;Department of Mathematics, Tianjin Polytechnic University, Tianjin, China

关键词: minimization;    equilibrium problem;    fixed point problem;    nonexpansive mapping;   

DOI  :  10.1186/1687-1812-2013-114

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

The projection methods for solving the minimization problems have been extensively considered in many practical problems, for example, the least-square problem. However, the computational difficulty of the projection might seriously affect the efficiency of the method. The purpose of this paper is to construct two algorithms by releasing projection for solving the minimization problem with the feasibility sets such as the set of fixed points of nonexpansive mappings and the solution set of the equilibrium problem. MSC:47J05, 47J25, 47H09, 65J15.

【 授权许可】

CC BY