کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1137309 1489183 2009 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Generalized over-relaxed proximal algorithm based on A-maximal monotonicity framework and applications to inclusion problems
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
Generalized over-relaxed proximal algorithm based on A-maximal monotonicity framework and applications to inclusion problems
چکیده انگلیسی

General framework for the over-relaxed proximal point algorithm using the notion of AA-maximal monotonicity (also referred to as AA-monotonicity in the literature) is developed, and then the convergence analysis for this algorithm in the context of solving a general class of nonlinear inclusion problems is examined along with some auxiliary results involving AA-maximal monotone mappings in a Hilbert space setting.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Mathematical and Computer Modelling - Volume 49, Issues 7–8, April 2009, Pages 1587–1594
نویسندگان
,