Add to ORKGWe announce the approximation-solvability of the following class of nonlinear variational inequality (NVI) problems based on a new generalized auxiliary problem principle: Find an element such that for all where is a mapping from a nonempty closed convex subset of a real Hilbert space into, and is a continuous convex functional on. The generalized auxiliary problem principle is described as follows: for a given iterate and, for constants and, compute such tha
Abstract The convex feasibility problem (CFP) of finding a point in the nonempty intersection is co...
In this paper, the auxiliary principle technique is extended to study a system of generalized nonlin...
AbstractBased on a new iterative algorithm, the solvability of a class of nonlinear variational ineq...
ABSTRACT. The approximation-solvability of the following class of nonlinear variational in-equality ...
AbstractThe approximation-solvability of the following class of nonlinear variational inequality pro...
AbstractFirst, a general framework for the auxiliary problem principle is introduced and then it is ...
Let T: K → H be a mapping from a nonempty closed convex subset K of a finite-dimensional Hilbert spa...
Let be a nonlinear mapping from a nonempty closed invex subset of an infinite-dimensional Hilbert...
AbstractConsider the convergence of the projection methods based on a new iterative algorithm for th...
Let T: K → H be a nonlinear mapping from a nonempty closed invex subset K of an infinite-dimensional...
AbstractIn this paper, we consider some applications of variational inequalities to nonlinear analys...
The first chapter provides some basic definitions and results from the theory of convex analysis and...
Abstract Let C be a nonempty closed and convex subset of a uniformly smooth and 2-uniformly convex r...
Abstract We know that variational inequality problem is very important in the nonlinear analysis. Th...
AbstractIn this paper, we introduce an iterative method for finding a common element of the set of s...
Abstract The convex feasibility problem (CFP) of finding a point in the nonempty intersection is co...
In this paper, the auxiliary principle technique is extended to study a system of generalized nonlin...
AbstractBased on a new iterative algorithm, the solvability of a class of nonlinear variational ineq...
ABSTRACT. The approximation-solvability of the following class of nonlinear variational in-equality ...
AbstractThe approximation-solvability of the following class of nonlinear variational inequality pro...
AbstractFirst, a general framework for the auxiliary problem principle is introduced and then it is ...
Let T: K → H be a mapping from a nonempty closed convex subset K of a finite-dimensional Hilbert spa...
Let be a nonlinear mapping from a nonempty closed invex subset of an infinite-dimensional Hilbert...
AbstractConsider the convergence of the projection methods based on a new iterative algorithm for th...
Let T: K → H be a nonlinear mapping from a nonempty closed invex subset K of an infinite-dimensional...
AbstractIn this paper, we consider some applications of variational inequalities to nonlinear analys...
The first chapter provides some basic definitions and results from the theory of convex analysis and...
Abstract Let C be a nonempty closed and convex subset of a uniformly smooth and 2-uniformly convex r...
Abstract We know that variational inequality problem is very important in the nonlinear analysis. Th...
AbstractIn this paper, we introduce an iterative method for finding a common element of the set of s...
Abstract The convex feasibility problem (CFP) of finding a point in the nonempty intersection is co...
In this paper, the auxiliary principle technique is extended to study a system of generalized nonlin...
AbstractBased on a new iterative algorithm, the solvability of a class of nonlinear variational ineq...