کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
840816 | 908492 | 2012 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem](/preview/png/840816.png)
چکیده انگلیسی
In this paper, we consider the split feasibility problem (SFP) in infinite-dimensional Hilbert spaces, and study the relaxed extragradient methods for finding a common element of the solution set ΓΓ of SFP and the set Fix(S) of fixed points of a nonexpansive mapping SS. Combining Mann’s iterative method and Korpelevich’s extragradient method, we propose two iterative algorithms for finding an element of Fix(S)∩Γ. On one hand, for S=IS=I, the identity mapping, we derive the strong convergence of one iterative algorithm to the minimum-norm solution of the SFP under appropriate conditions. On the other hand, we also derive the weak convergence of another iterative algorithm to an element of Fix(S)∩Γ under mild assumptions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Nonlinear Analysis: Theory, Methods & Applications - Volume 75, Issue 4, March 2012, Pages 2116–2125
Journal: Nonlinear Analysis: Theory, Methods & Applications - Volume 75, Issue 4, March 2012, Pages 2116–2125
نویسندگان
L.-C. Ceng, Q.H. Ansari, J.-C. Yao,