期刊文献+

一种修正的m步松弛投影法

One Kind of m-Steps Modified Relaxed Projection Method
下载PDF
导出
摘要 在松弛投影法的基础上,用超平面来代替凸集,充分利用已经求出的最优参数,构造出一种新的解决凸可行性问题的算法,即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
  • 相关文献

参考文献7

  • 1[1]TAKAHSHI W,SHIMOJI K.Convergence Theorems for Nonexpansive Mappings and Feasibility Problems[J].Math.and Comp.Modelling,2000,32:1 463-1 471.
  • 2[2]COMBETTES P L.Strong Convergence of Black-Iterative Outer Approximation Methods for Convex Optimization[J].SIAM.J.Control Optim,2000,38:538-565.
  • 3[3]BAUSCHKE H H,BORUEIN J M.On Projection Algorithms for Solving Convex Feasibility Problems[J].SIAM.Review,1996,38:367-426.
  • 4[4]SHIMIZU T,THKAHASHI W.Strong Convergence to Common Fixed Points of Families of Nonexpansive Mappings[J].J.Math.Anal.Appl.,1997,211:71-83.
  • 5[5]AHARONI R,BERMAN A,CENSOR Y.An Interior Points Algorithm for the Convex Feasibility[J].Adv.in Appl.Math.,1983,4:479-489.
  • 6[6]FLAM S D,JOCHEM ZOWE.Relaxed Outer Projections,Weighted Averages and Convex Feasibility[J].BIT,1990,30:289-300.
  • 7[7]HENRY STARK.Image Recovery:Theory and Application[M].Troy,Newyork,1997.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部