摘要
在松弛投影法的基础上,用超平面来代替凸集,充分利用已经求出的最优参数,构造出一种新的解决凸可行性问题的算法,即m步修正松弛投影法,并证明了该算法是强收敛的.
Based on the relaxed projection method,the author uses a hyperplane to substitute for the convex set and makes full use of the calculated bestparameter.A new algorithm named m-steps modified relaxed projection method is constructed to solve the convex feasibility problem.Furthermore,the algorithm is proved to be strong convergence.
出处
《吉首大学学报(自然科学版)》
CAS
2006年第5期6-9,共4页
Journal of Jishou University(Natural Sciences Edition)
基金
湖南省教育厅科学研究项目(05C143)
关键词
凸可行性问题
松弛投影法
m步修正松弛投影法
弱收敛
强收敛
convex feasibility problem
relaxed projection method
m-steps modified relaxed projection method
weakly convergence
strong convergence