| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 472052 | Computers & Mathematics with Applications | 2009 | 5 Pages |
Abstract
A new relaxed algorithmic procedure based on the notion of AA-maximal relaxed monotonicity is developed, and then the convergence analysis in the context of solving a general class of nonlinear inclusion problems is examined. Furthermore, some results involving AA-maximal relaxed monotone mappings in a Hilbert space setting are included.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ram U. Verma,