| 求解分裂可行问题逆问题的算法推广 |
| |
| 引用本文： | 王新艳,屈彪.求解分裂可行问题逆问题的算法推广[J].泰山学院学报,2010,32(6):10-14. |
| |
| 作者姓名： | 王新艳 屈彪 |
| |
| 作者单位： | 曲阜师范大学管理学院; |
| |
| 基金项目： | 国家自然科学基金，山东省优秀中青年科学家科研奖励基金 |
| |
| 摘 要： | 本文主要对解决分裂可行问题逆问题的算法进行了推广.推广后的算法使得迭代点变多,充满了整个区间,并证明了推广后算法的全局收敛性.另外,还给出了推广算法的不精确格式,并证明了该不精确格式的收敛性.推广后算法的不精确格式解决了正交投影难计算的问题.
|
| 关 键 词： | 分裂可行问题 逆问题 正交投影 不精确格式 |
Generalization of the Algorithm for Solving the Inverse Split Feasibility Problem |
| |
| WANG Xin-yan,QU Biao.Generalization of the Algorithm for Solving the Inverse Split Feasibility Problem[J].Journal of Taishan University,2010,32(6):10-14. |
| |
| Authors: | WANG Xin-yan QU Biao |
| |
| Institution: | WANG Xin-yan,QU Biao (School of Management,Qufu Normal University,Rizhao,276826,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | split feasibility problem inverse problem orthogonal projection inexact format |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
