摘要
本文主要给出了求解分裂等式问题的一种简单投影算法及其松弛算法,证明了算法的全局收敛性.与相关算法相比,该算法每一步的迭代步长都可直接计算出,避免了计算矩阵的谱半径.
In this paper, we mainly introduce a simple projection method and its relaxation to solve the split equality problems. The global convergence property is also proved. Compared with the related algo- rithms, the step - size in these method is computed directly. The algorithm avoids calculating the spectral radius of the matrix.
出处
《泰山学院学报》
2013年第3期38-40,共3页
Journal of Taishan University
基金
国家自然科学基金项目(11271226
10971118)
山东省优秀中青年科学家科研奖励基金资助项目(BS2010SF010)
关键词
分裂等式问题
正交投影
松弛投影
split equality problems
orthogonal projection
relaxed projection
