General system of -maximal relaxed monotone variational inclusion problems based on generalized hybrid algorithms

✍ Scribed by Ravi P. Agarwal; Ram U. Verma

• Publisher: Elsevier Science
• Year: 2010
• Tongue: English
• Weight: 307 KB
• Volume: 15
• Category: Article
• ISSN: 1007-5704
• DOI: 10.1016/j.cnsns.2009.03.037

✦ Synopsis

In this paper, a new system of nonlinear (set-valued) variational inclusions involving ðA; gÞmaximal relaxed monotone and relative ðA; gÞ-maximal monotone mappings in Hilbert spaces is introduced and its approximation solvability is examined. The notion of ðA; gÞmaximal relaxed monotonicity generalizes the notion of general g-maximal monotonicity, including ðH; gÞ-maximal monotonicity (also referred to as ðH; gÞ-monotonicity in literature). Using the general ðA; gÞ-resolvent operator method, approximation solvability of this system based on a generalized hybrid iterative algorithm is investigated. Furthermore, for the nonlinear variational inclusion system on hand, corresponding nonlinear Yosida regularization inclusion system and nonlinear Yosida approximations are introduced, and as a result, it turns out that the solution set for the nonlinear variational inclusion system coincides with that of the corresponding Yosida regularization inclusion system. Approximation solvability of the Yosida regularization inclusion system is based on an existence theorem and related Yosida approximations. The obtained results are general in nature.