๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


A new class of iterative algorithms for
โœ R.U Verma ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 436 KB

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

An iterative algorithm based on -proxima
โœ K.R. Kazmi; M.I. Bhat; Naeem Ahmad ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 751 KB

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

A class of iteration methods based on th
โœ Zhong-Zhi Bai ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 945 KB

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