Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1710098 | Applied Mathematics Letters | 2009 | 6 Pages |
Abstract
First, a general framework for the over-relaxed AA-proximal point algorithm based on the AA-maximal monotonicity is introduced, and second it is applied to the approximation solvability of a general class of nonlinear inclusion problems using the generalized resolvent operator technique. The over-relaxed AA-proximal point algorithm is of interest in the sense that it is quite application-oriented, but nontrivial in nature. The results obtained are general in nature.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Ram U. Verma,