General implicit variational inclusion problems based on \(A\)-maximal (\(m\))-relaxed monotonicity (AMRM) frameworks (Q732497): Difference between revisions

The subject of this work is the study of general implicit variational inclusion problems based on \(A\)-maximal \((m)\)-relaxed monotonicity frameworks. A general class of nonlinear implicit inclusion of the form: \[ 0 \in T(x) + Mg(x) \] (\(M: X \rightarrow 2^x\) is a set-valued mapping on \(X\) and \(T,g: X \rightarrow X\) are single-valued mappings on \(X\) with range \((g) \cap \text{dom}(M) \neq 0\)), is considered. As variational inclusion problems are closely associated with variational inequality problems, variational inclusions impact greatly the applications to several other fields such as mathematical finance, management and decision sciences and mathematical programming. The notions of \(A\)-maximal \((m)\)-relaxed monotonicity and \((H)\)-maximal monotonicity are described and some auxiliary results are obtained for the problem on hand. Main result: Existence theorems on the solvability of (1) to the context of \(A\)-maximal \((m)\)-relaxed monotonicity framework are precisely established. Generalized implicit algorithms are introduced and then applied to the approximation solvability of nonlinear implicit variational inclusion problem (1). A new version of the implicit algorithmic procedure (hybrid implicit algorithmic procedure) and its applications to approximation solvability of inclusion problems of the form (1) (based on the \(A\)-maximal \((m)\)-relaxed monotonicity frameworks) is introduced.