摘要
在无需目标函数的情况下,对多值分解可行问题给出了一种松弛投影算法,证明了该算法的全局收敛性,并将其应用于约束多值分解可行问题的求解,结果表明该算法是有效的。
Under the condition of no objective functions, this paper has presented a relaxed projection-like algorithm for the multiple-sets split feasibility problem and proved the global convergence of this algorithm. This algorithm is also applied to solve the constrained multiple-sets split feasibility problem, and numerical results show that the proposed methods are promising.
出处
《洛阳理工学院学报（自然科学版）》
2008年第2期80-83,共4页
Journal of Luoyang Institute of Science and Technology：Natural Science Edition
基金
国家自然科学基金资助项目(10701047)
曲阜师范大学校基金资助项目(XJ0625)
关键词
多值分解可行问题
松弛投影算法
收敛
Multiple-sets split feasibility problem
Relaxed projection algorithm
Convergence
