Generalized over-relaxed proximal algorithm based on A-maximal monotonicity framework and applications to inclusion problems

被引：10

作者：

Verma, Ram U. ^{[1
]}

机构：

[1] Int Publicat USA, Orlando, FL 32828 USA

来源：

MATHEMATICAL AND COMPUTER MODELLING | 2009年 / 49卷 / 7-8期

关键词：

Variational inclusions; Maximal monotone mapping; A-maximal monotone mapping; Generalized resolvent operator; VARIATIONAL INCLUSIONS; SENSITIVITY-ANALYSIS; SPLITTING METHOD; POINT ALGORITHM; SYSTEM; (A; OPERATORS;

D O I：

10.1016/j.mcm.2008.05.045

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

General framework for the over-relaxed proximal point algorithm using the notion of A-maximal monotonicity (also referred to as A-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 A-maximal monotone mappings in a Hilbert space setting. (C) 2008 Elsevier Ltd. All rights reserved.

引用

页码：1587 / 1594

页数：8

共 33 条

[21]

Verma R. U., 2006, MATH SCI RES J, V10, P79

[22] A-monotone nonlinear relaxed cocoercive variational inclusions [J].