A Modified Projection Method for Convex Feasibility Problem

摘要：

In this paper, we propose a modified projection method for solving the convex feasibility problem based on the method proposed by Dudek (J. Optim. Theory. Appl.,2007, 132:401-410). In this method, we compute the next iterate by several projections onto hyperplanes and a surrogate technique. For this new method, we prove its global convergence provided that the solution set is nonempty.

关键词： projection algorithm convex feasibility problem subgradient

作者: Yingni Wang Hongyu Zhang Dexiang Feng

作者单位: School of Operations Research and Management Sciences, Qufu Normal University Rizhao, Shandong, 2768 Donghua University,Shanghai,201620,China

会议类型: 国际会议

会议名称: The 1st International ELID-Grinding Conference(第一届镜面磨削技术国际会议)

会议地点: 长沙

会议语种:英文

页码: 744-748

在线出版日期: 2008-06-12（万方平台首次上网日期，不代表论文的发表时间）