| 求解分裂可行问题的一种松驰投影算法 |
| |
| 引用本文： | 兰晓坚,李连忠,屈彪.求解分裂可行问题的一种松驰投影算法[J].泰山学院学报,2009,31(6):9-14. |
| |
| 作者姓名： | 兰晓坚 李连忠 屈彪 |
| |
| 作者单位： | 1. 曲阜师范大学运筹与管理学院,山东,日照,276826
2. 泰山学院数学与系统科学学院,山东,泰安,271021 |
| |
| 基金项目： | 国家自然科学基金，曲阜师范大学校基金 |
| |
| 摘 要： | 本文提出了一种新的算法来求解分裂可行问题,该算法在每步迭代中应用类-Armijo搜索来获取调整步长,然后给出了一个校正步长,避免了矩阵逆和矩阵最大特征值的计算.我们证明了该算法的全局收敛性.
|
| 关 键 词： | 分裂可行问题 类-Armijo搜索 松弛投影算法 收敛 |
A Relaxed Projection Algorithm for Split Feasibility Problem |
| |
| LAN Xiao-jian,LI Lian-zhong,QU Biao.A Relaxed Projection Algorithm for Split Feasibility Problem[J].Journal of Taishan University,2009,31(6):9-14. |
| |
| Authors: | LAN Xiao-jian LI Lian-zhong QU Biao |
| |
| Institution: | 1. School of Operations Research and Management Sciences, Qufu Normal University, Rizhao, 276826 ; 2. School of Mathematics and Systems Science, Taishan University, Tai＇an, 271021 ,China ) |
| |
| Abstract: | In this paper,we present a new algorithm for solving the SFP,in which a predictor stepsize is first obtained by like-Armijo search and then a corrector stepsize is generated.The algorithm has the advantage that it is no need to compute the matrix inverses and the largest eigenvalue of the related matrix.The corresponding convergence properties of the algorithm are shown. |
| |
| Keywords: | split feasiblity problem like-Armijo search relaxed projection algorithm convergence |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
