Complementarity Problems
Projective algorithms for solving complementarity problems
... 8. Conclusion and possible future directions. Several algorithms have been pre- sented. Firstly, they provide yet another means for which one might solve both linear and generalized linear complementarity ...
15
Variational inequality formulation of circular cone eigenvalue complementarity problems
... eigenvalue complementarity problems (EiCP) have received great attention, since they have a wide range of applications in engineering, such as the contact problems in mechanics, electrical circuit ...
14
Generalized strongly set valued nonlinear complementarity problems
... The complementarity theory, which was introduced by Lemke [11], Cottle, and Dantzig [6] in the early 1960s and later developed by others, plays an im- portant and fundamental role in the study of a wide class of ...
8
A Singular Values Based Newton Method for Linear Complementarity Problems
... plementarity problems is obtained by the relationship between penalized equations and an abso- lute value ...linear complementarity problems is ...of complementarity problems of its ...
6
New global error bound for extended linear complementarity problems
... mization problems such as variational inequalities and nonlinear complementarity prob- lems ...linear complementarity problems is well studied (see, ...linear complementarity prob- ...
16
An improved error bound for linear complementarity problems for B matrices
... 3. Berman, A, Plemmons, RJ: Nonnegative Matrix in the Mathematical Sciences. SIAM, Philadelphia (1994) 4. Cottle, RW, Pang, JS, Stone, RE: The Linear Complementarity Problem. Academic Press, San Diego (1992) 5. ...
10
Complementarity problems via common fixed points in vector lattices
... Nemeth introduced the notion of order weakly L-Lipschitz mapping and employed this concept to obtain nontrivial solutions of nonlinear complementarity problems. In this article, we shall extend this concept ...
13
An active set algorithm for a class of linear complementarity problems arising from rigid body dynamics
... An active set algorithm is introduced for positive definite and positive semi definite linear complementarity problems. The proposed algorithm is composed of two phases. Phase 1, the feasibility phase and ...
14
Finite algorithms for the numerical solutions of a class of nonlinear complementarity problems
... In this paper, we present some finite algorithms to the numerical solution of almost linear (mixed) complementarity problems. The algorithms are based on the systems of piecewise almost linear equations, ...
17
A New Conjugate Gradient Projection Method for Solving Stochastic Generalized Linear Complementarity Problems
... In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate ...
8
An alternative error bound for linear complementarity problems involving \(B^{S}\) matrices
... An alternative error bound for linear complementarity problems for B S -matrices is presented. It is shown by numerical examples that the new bound is better than that provided by García-Esnaola and Peña ...
9
A modified feasible semi smooth asymptotically Newton method for nonlinear complementarity problems
... In this paper, a modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems is proposed. The global convergence of the method and superlinear convergence are proved ...
13
Convergence results of a matrix splitting algorithm for solving weakly nonlinear complementarity problems
... In this paper, we consider a class of weakly nonlinear complementarity problems (WNCP) with large sparse matrix. We present an accelerated modulus-based matrix splitting algorithm by reformulating the WNCP ...
9
LQP method with a new optimal step size rule for nonlinear complementarity problems
... Solving the subproblem (.) or (.) exactly is typically hard demand in practice. To over- come this difficulty, He et al. [], Bnouhachem [, ], Bnouhachem and Yuan [], Bnouhachem and Noor [, ], Bnouhachem et ...
11
Kernel function based interior point methods for horizontal linear complementarity problems
... It is well known that each kernel function defines an interior-point algorithm. In this paper we propose new classes of kernel functions whose form is different from known kernel functions and define interior-point methods ...
15
Iteration complexity of generalized complementarity problems
... generalized complementarity problems To estimate the worst-case convergence rates measured by the iteration complexity for ...tarity problems characterization and projection equation residual, ...
13
Feasibility of set valued implicit complementarity problems
... the complementarity problems is based on the concept of an exceptional family of elements for a continuous ...plicit) complementarity problems by using the exceptional family of elements ...
14
Generalized Vector Complementarity Problems with Moving Cones
... vector complementarity problems with moving ...vector complementarity problem under inclusive type ...vector complementarity problem, the generalized vector variational inequality problem, and ...
16
Iterative methods for nonlinear quasi complementarity problems
... Related to quasi variational inequalities, we now introduce a new class of complementarity problems,.. which will be called quasi complement-.[r] ...
6
An Interval Matrix Based Generalized Newton Method for Linear Complementarity Problems
... In this section, we will propose that a new generalized Newton method based on the nonlinear penalized equa- tion for solving the linear complementarity problem. Because when k > 1 , penalty term of the ...
7