Consider the convergence of the projection methods based on a new iterative algorithm for the approximation-solvability of the following class of nonlinear variational inequality (NVI) problems: find an element x\* E K such that where T : K ---, H is a mapping from a nonempty closed convex subset K
The solvability of a class of generalized nonlinear variational inequalities based on an iterative algorithm
โ Scribed by R.U. Verma
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 161 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
โฆ Synopsis
Based on a new iterative algorithm, the solvability of a class of nonlinear variational inequalities involving a combination of relaxed monotone operators in a Hilbert space setting is presented.
๐ SIMILAR VOLUMES
In this paper, we give the notion of M-proximal mapping, an extension of P-proximal mapping given in [X.P. Ding, F.Q. Xia, A new class of completely generalized quasivariational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369-383], for a nonconvex, proper, lower semicontinuous and
Many stochastic models in queueing, inventory, communications, and dam theories, etc., result in the problem of numerically determining the minimal nonnegative solutions for a class of nonlinear matrix equations. Various iterative methods have been proposed to determine the matrices of interest. We