Approximate subgradient projection algorithm for convex feasibility problem

作     者：Li Li Yan Gao 

作者机构：Business School University of Shanghai for Science and Technology Shanghai 200093 P. R. China 

出 版 物：《Journal of Systems Engineering and Electronics》 (系统工程与电子技术（英文版）)

年 卷 期：2010年第21卷第3期

页      面：527-530页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 07[理学] 070105[理学-运筹学与控制论] 0802[工学-机械工程] 0811[工学-控制科学与工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Natural Science Foundation of China (10671126) Shanghai Leading Academic Discipline Project(S30501) 

主　　题：ε-subgradient projection algorithm convex feasibility problem. 

摘      要：An ε-subgradient projection algorithm for solving a convex feasibility problem is *** on the iterative projection methods and the notion of ε-subgradient,a series of special projection hyperplanes is ***,compared with the existing projection hyperplanes methods with subgradient,the proposed hyperplanes are interactive with ε,and their ranges are more *** convergence of the proposed algorithm is given under some mild conditions,and the validity of the algorithm is proved by the numerical test.