AbstractIn this paper, we consider an iterative for a class of quasi complementarity problems of finding u ϵ Rn such that g(u) ϵ K(u), (Mu + q) ϵ K∗(u), (g(u), Mu + q) = 0, where g is a continuous mapping from Rn into itself, M ϵ Rn x n, q ϵ Rn, and K∗(u) is the polar cone of the convex cone K(u) in Rn. The algorithms considered in this paper are general and unifying ones, which include many existing algorithms as special cases for solving the complementarity problems. We also study the convergence criteria of the general algorithms
AbstractWe consider and study an algorithm for a new class of complementarity problems of finding u ...
An iterative scheme is given for solving the linear complementarity problem x> 0, Mx + q> 0, x...
AbstractWe consider SOR- and JOR-type iterative methods for solving linear complementarity problems....
AbstractIn this paper, we consider an iterative for a class of quasi complementarity problems of fin...
AbstractIn this paper, we consider and study a new unified algorithm for obtaining the approximate s...
ABSTRACT. In this paper, we consider and study an iterative algorithm for finding the approximate so...
AbstractIn this paper, we consider and study a new unified algorithm for obtaining the approximate s...
ABSTRACT. In this paper, we consider the iterative methods for the quasi complemen-tar Lt problems o...
AbstractAn iterative algorithm is given to obtain the approximate solution of a new class of complem...
AbstractVariational inequality techniques are used to suggest a unified and general iterative algori...
AbstractIn this paper, we introduce and study a class of completely generalized strongly nonlinear q...
AbstractIn this paper, we introduce and study a class of completely generalized strongly nonlinear q...
A unified treatment is given for iterative algorithms for the solution of the symmetric 1inear compl...
We present robust projective algorithms of the von Neumann type for the linear comple-mentarity prob...
We present robust projective algorithms of the von Neumann type for the linear comple-mentarity prob...
AbstractWe consider and study an algorithm for a new class of complementarity problems of finding u ...
An iterative scheme is given for solving the linear complementarity problem x> 0, Mx + q> 0, x...
AbstractWe consider SOR- and JOR-type iterative methods for solving linear complementarity problems....
AbstractIn this paper, we consider an iterative for a class of quasi complementarity problems of fin...
AbstractIn this paper, we consider and study a new unified algorithm for obtaining the approximate s...
ABSTRACT. In this paper, we consider and study an iterative algorithm for finding the approximate so...
AbstractIn this paper, we consider and study a new unified algorithm for obtaining the approximate s...
ABSTRACT. In this paper, we consider the iterative methods for the quasi complemen-tar Lt problems o...
AbstractAn iterative algorithm is given to obtain the approximate solution of a new class of complem...
AbstractVariational inequality techniques are used to suggest a unified and general iterative algori...
AbstractIn this paper, we introduce and study a class of completely generalized strongly nonlinear q...
AbstractIn this paper, we introduce and study a class of completely generalized strongly nonlinear q...
A unified treatment is given for iterative algorithms for the solution of the symmetric 1inear compl...
We present robust projective algorithms of the von Neumann type for the linear comple-mentarity prob...
We present robust projective algorithms of the von Neumann type for the linear comple-mentarity prob...
AbstractWe consider and study an algorithm for a new class of complementarity problems of finding u ...
An iterative scheme is given for solving the linear complementarity problem x> 0, Mx + q> 0, x...
AbstractWe consider SOR- and JOR-type iterative methods for solving linear complementarity problems....