journal6 ›› 2006, Vol. 27 ›› Issue (5): 6-9.

• Mathematics • Previous Articles     Next Articles

One Kind of m-Steps Modified Relaxed Projection Method


  1. (College of Mathematics and Computer Sciences,Jishou University,Jishou 416000,Hunan China)
  • Online:2006-09-25 Published:2012-06-29

Abstract: 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.

Key words: convex feasibility problem, relaxed projection method, m-steps modified relaxed projection method, weakly convergence, strong convergence

WeChat e-book chaoxing Mobile QQ