Generalized Relaxation of a Class of Operators for Solving Convex Feasibility Problem
عنوان مقاله: Generalized Relaxation of a Class of Operators for Solving Convex Feasibility Problem
شناسه ملی مقاله: ICIORS14_135
منتشر شده در چهاردهمین کنفرانس بین المللی انجمن ایرانی تحقیق در عملیات در سال 1400
شناسه ملی مقاله: ICIORS14_135
منتشر شده در چهاردهمین کنفرانس بین المللی انجمن ایرانی تحقیق در عملیات در سال 1400
مشخصات نویسندگان مقاله:
Mahdi Mirzapour - Assistant Professor, Department of Mathematics, Bu-Ali Sina University, Hamedan, Iran
خلاصه مقاله:
Mahdi Mirzapour - Assistant Professor, Department of Mathematics, Bu-Ali Sina University, Hamedan, Iran
In this paper, we study a fixed point iteration method based on generalized relaxation of string averaging operator. The string averaging operator will be constructed such a way that each string be made by composition of finitely many strictly quasi-nonexpansive operators. The constructed iterative method includes wide class of iterative methods for solving linear systems of equations (inequalities) and fixed-point iterations for solving nonlinear convex feasibility problems. To illustrate the performance of using generalized relaxation, some experiments in image reconstruction from projections is presented.
کلمات کلیدی: Convex feasibility problem, Generalized relaxation, Quasi-nonexpansive operators, String averaging
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1366069/