کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4626730 1631792 2015 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
چکیده انگلیسی

In the CQ-like algorithms for the split feasibility problem, in order to get the step-size, one has to compute the largest eigenvalue of the related matrix or use some line search scheme. Our contribution in this short note is to give a simple CQ-like algorithm in which the step-size is directly computed. The algorithm presented in this paper not only need not to compute the largest eigenvalue of the related matrix but also need not to use any line search scheme. The theoretical convergence and numerical results are also given.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 262, 1 July 2015, Pages 218–223
نویسندگان
, , ,