求解分裂可行问题逆问题的算法推广  

Generalization of the Algorithm for Solving the Inverse Split Feasibility Problem

作　　者：王新艳[1] 屈彪[1] 

机构地区：[1]曲阜师范大学管理学院,山东日照276826

出　　处：《泰山学院学报》2010年第6期10-14,共5页Journal of Taishan University

基　　金：国家自然科学基金项目(10701047);山东省优秀中青年科学家科研奖励基金项目(BS2010SF010)

摘　　要：本文主要对解决分裂可行问题逆问题的算法进行了推广.推广后的算法使得迭代点变多,充满了整个区间,并证明了推广后算法的全局收敛性.另外,还给出了推广算法的不精确格式,并证明了该不精确格式的收敛性.推广后算法的不精确格式解决了正交投影难计算的问题.This paper mainly generalizes the algorithm for solving the inverse split feasibility problem.The algorithm proposed in this paper can get more iteration points which may be full of the whole interval.The global convergence of this method is proved.In addition,the paper also gives the inexact format of the new algorithm,and proves the convergence of this method.The inexact format of the new algorithm solves the difficulty of computing the orthogonal projection.

关 键 词：分裂可行问题 逆问题 正交投影 不精确格式 

分 类 号：O22[理学—运筹学与控制论]