We consider SOR- and JOR-type iterative methods for solving linear complementarity problems. If the solution set is not discrete, weak-convergence proofs are usually obtained for these methods; i.e., every accumulation point of the generated sequence is a solution. We prove that, for the convex case, the whole sequence converges, and if the limit point is nondegenerate, convergence is linear.15460161
Generalizing recent results in [M. K. Camlibel, Complementarity Methods in the Analysis of Piecewise...
AbstractIn this paper we present a recursion related to a nonlinear complementarity problem defined ...
In the case that the matrix of a linear complementarity problem consists of the sum of a positive se...
AbstractWe consider SOR- and JOR-type iterative methods for solving linear complementarity problems....
Abstract-In this paper, we propose two new iterative SAOR methods to solve the linear complementarit...
We consider a matrix splitting algorithm for the linear complementarity problem where the matrix is ...
We consider iterative methods using splittings for solving symmetric positive semidefinite linear co...
A unified treatment is given for partially and totally asynchronous parallel successive over-relaxat...
An iterative scheme is given for solving the linear complementarity problem x> 0, Mx + q> 0, x...
For solving linear complementarity problems LCP more attention has recently been paid on a class of ...
This note derives bounds on the length of the primal-dual affine scaling directions associated with ...
Abstract. This note points out an error in the local quadratic convergence proof of the predictor-co...
AbstractIn this paper, we consider an iterative for a class of quasi complementarity problems of fin...
AbstractIt is shown that Mangasarian's general iterative algorithm for solving the symmetric linear ...
Cover title.Includes bibliographical references (p. 45-48).Partially supported by the U.S. Army Rese...
Generalizing recent results in [M. K. Camlibel, Complementarity Methods in the Analysis of Piecewise...
AbstractIn this paper we present a recursion related to a nonlinear complementarity problem defined ...
In the case that the matrix of a linear complementarity problem consists of the sum of a positive se...
AbstractWe consider SOR- and JOR-type iterative methods for solving linear complementarity problems....
Abstract-In this paper, we propose two new iterative SAOR methods to solve the linear complementarit...
We consider a matrix splitting algorithm for the linear complementarity problem where the matrix is ...
We consider iterative methods using splittings for solving symmetric positive semidefinite linear co...
A unified treatment is given for partially and totally asynchronous parallel successive over-relaxat...
An iterative scheme is given for solving the linear complementarity problem x> 0, Mx + q> 0, x...
For solving linear complementarity problems LCP more attention has recently been paid on a class of ...
This note derives bounds on the length of the primal-dual affine scaling directions associated with ...
Abstract. This note points out an error in the local quadratic convergence proof of the predictor-co...
AbstractIn this paper, we consider an iterative for a class of quasi complementarity problems of fin...
AbstractIt is shown that Mangasarian's general iterative algorithm for solving the symmetric linear ...
Cover title.Includes bibliographical references (p. 45-48).Partially supported by the U.S. Army Rese...
Generalizing recent results in [M. K. Camlibel, Complementarity Methods in the Analysis of Piecewise...
AbstractIn this paper we present a recursion related to a nonlinear complementarity problem defined ...
In the case that the matrix of a linear complementarity problem consists of the sum of a positive se...