Weights in block iterative methods
سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 110
فایل این مقاله در 13 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJNAA-5-2_006
تاریخ نمایه سازی: 11 آذر 1401
چکیده مقاله:
In this paper we introduce a sequential block iterative method and its simultaneous version with optimal combination of weights (instead of convex combination) for solving convex feasibility problems. When the intersection of the given family of convex sets is nonempty, it is shown that any sequence generated by the given algorithms converges to a feasible point. Additionally for linear feasibility problems, we give equivalency of our algorithms with sequential and simultaneous block Kaczmarz methods explaining the optimal weights have been inherently used in Kaczmarz methods. In addition, a convergence result is presented for simultaneous block Kaczmarz for the case of inconsistent linear system of equations.
کلیدواژه ها: