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
The Monomial Preconditioned SSOR Method for Linear Complementarity Problem
IEEE Access, 2019 This paper aims to show that the existing preconditioned symmetric successive over-relaxation (SSOR) approach to solving the linear complementarity problem (LCP) is not valid.
Xinna Mao +3 more
doaj +2 more sources
Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2002 A P*-Nonlinear Complementarity Problem as a generalization of the P*-Linear Complementarity Problem is considered. We show that the long-step version of the homogeneous self-dual interior-point algorithm could be used to solve such a problem.
Lešaja Goran
doaj +4 more sources
On the preconditioned GAOR method for a linear complementarity problem with an M-matrix [PDF]
Journal of Inequalities and Applications, 2018 Recently, based on the Hadjidimos preconditioner, a preconditioned GAOR method was proposed for solving the linear complementarity problem (Liu and Li in East Asian J. Appl. Math. 2:94–107, 2012).
Shu-Xin Miao, Dan Zhang
doaj +2 more sources
Asymptotic Analysis for One-Stage Stochastic Linear Complementarity Problems and Applications
Mathematics, 2023 One-stage stochastic linear complementarity problem (SLCP) is a special case of a multi-stage stochastic linear complementarity problem, which has important applications in economic engineering and operations management.
Shuang Lin, Jie Zhang, Chen Qiu
doaj +2 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
On Column Competent Matrices and Linear Complementarity Problem [PDF]
International Conference on Mathematics and Computing, 2021 We revisit the class of column competent matrices and study some matrix theoretic properties of this class. The local $w$-uniqueness of the solutions to the linear complementarity problem can be identified by the column competent matrices.
A. Dutta, R. Jana, A. K. Das
semanticscholar +1 more source
Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem [PDF]
SIAM Journal on Optimization, 2020 The linear complementarity problem (LCP) is a general set membership problem that includes quadratic cone programming as a special case. In this work we consider a homogeneous embedding of the LCP, which encodes both the optimality conditions of the ...
Brendan O'Donoghue
semanticscholar +1 more source
Scarf’s generalization of linear complementarity problem revisited [PDF]
Yugoslav Journal of Operations Research, 2013 In this paper, we revisit Scarf’s generalization of the linear complementarity problem, formulate this as a vertical linear complementarity problem and obtain some new results on this generalization.
Neogy S.K., Sinha S., Das A.K., Gupta A.
doaj +1 more source
New error bounds for the tensor complementarity problem
Electronic Research Archive, 2022 This paper discusses new error bounds for the tensor complementarity problem using a P-tensor. A new lower error bound and a global error bound are presented for such a problem.
Xin Liu, Guang-Xin Huang
doaj +1 more source