New global error bound for extended linear complementarity problems [PDF]
Journal of Inequalities and Applications, 2018 For the extended linear complementarity problem (ELCP), by virtue of a new residual function, we establish a new type of global error bound under weaker conditions.
Hongchun Sun, Min Sun, Yiju Wang
doaj +2 more sources
An alternative error bound for linear complementarity problems involving BS $B^{S}$-matrices [PDF]
Journal of Inequalities and Applications, 2018 An alternative error bound for linear complementarity problems for BS $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 (Appl. Math. Lett.
Lei Gao
doaj +2 more sources
The extended linear complementarity problem [PDF]
SIAM Journal on Matrix Analysis and Applications, 1995 In this paper we define the Extended Linear Complementarity Problem (ELCP), an extension of the well-known Linear Complementarity Problem (LCP). We study the general solution set of an ELCP and we present an algorithm to find all its solutions.
Bart De Moor, Bart De Schutter
core +8 more sources
An improved error bound for linear complementarity problems for B-matrices [PDF]
Journal of Inequalities and Applications, 2017 A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in (Li et al. in Electron. J. Linear Algebra 31(1):476-484, 2016).
Lei Gao, Chaoqian Li
doaj +2 more sources
Error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices [PDF]
Journal of Inequalities and Applications, 2017 In this paper, new error bounds for the linear complementarity problem are obtained when the involved matrix is a weakly chained diagonally dominant B-matrix. The proposed error bounds are better than some existing results.
Feng Wang
doaj +2 more sources
Parameterized Complexity of Sparse Linear Complementarity Problems [PDF]
Algorithmica, 2015 In this paper, we study the parameterized complexity of the linear complementarity problem (LCP), which is one of the most fundamental mathematical optimization problems.
Kakimura, Naonori +2 more
core +6 more sources
Linear complementarity problems solvable as linear programs
Journal of Numerical Analysis and Approximation Theory, 2018 In this paper, we present a theoretical and numerical study of linear complementary problems solvable as linear programs. We give several examples of linear complementarity problems which can be solved as linear programs using linear programming ...
Zakia Kebbiche
doaj +4 more sources
Polyhedral complementarity problem with quasimonotone decreasing mappings [PDF]
Yugoslav Journal of Operations Research, 2023 The fixed point problem of piecewise constant mappings in Rn is investigated. This is a polyhedral complementarity problem, which is a generalization of the linear complementarity problem.
Shmyrev Vadim I.
doaj +1 more source
CKV-type B-matrices and error bounds for linear complementarity problems
AIMS Mathematics, 2021 In this paper, we introduce a new subclass of P-matrices called Cvetković-Kostić-Varga type B-matrices (CKV-type B-matrices), which contains DZ-type-B-matrices as a special case, and present an infinity norm bound for the inverse of CKV-type B-matrices ...
Xinnian Song, Lei Gao
doaj +1 more source
Extensions of P-property, R0-property and semidefinite linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2017 In this manuscript, we present some new results for the semidefinite linear complementarity problem, in the context of three notions for linear transformations, viz., pseudo w-P property, pseudo Jordan w-P property and pseudo SSM property ...
Jeyaraman I. +2 more
doaj +1 more source