Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
472395 | Computers & Mathematics with Applications | 2008 | 7 Pages |
Abstract
First the general framework for a generalized over-relaxed proximal point algorithm using the notion of HH-maximal monotonicity (also referred to as HH-monotonicity) 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 on the resolvent operators corresponding to HH-maximal monotonicity.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ram U. Verma,