Results 251 to 260 of about 8,709,898 (283)
Some of the next articles are maybe not open access.
Mediterranean Journal of Mathematics, 2005
In this paper, generalization of a vertical block linear complementarity problem associated with two different types of matrices, one of which is a square matrix and the other is a vertical block matrix, is proposed. The necessary and sufficient conditions for the existence of the solution of the generalized vertical block linear complementarity ...
Bidushi Chakraborty +2 more
openaire +1 more source
In this paper, generalization of a vertical block linear complementarity problem associated with two different types of matrices, one of which is a square matrix and the other is a vertical block matrix, is proposed. The necessary and sufficient conditions for the existence of the solution of the generalized vertical block linear complementarity ...
Bidushi Chakraborty +2 more
openaire +1 more source
Backward errors of the linear complementarity problem
Numerical Algorithms, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xian-Ping Wu, Ri-Huan Ke
openaire +2 more sources
Newton's method for linear complementarity problems
Mathematical Programming, 1984zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
NP-Completeness of the linear complementarity problem
Journal of Optimization Theory and Applications, 1989We consider the linear complementarity problem (q,M) for which the data is the integer column vector \(q\in R^ n\) and the integer square matrix M of order n. GLCP is the decision problem: Does (q,M) have a solution? We show that GLCP is NP-complete in the strong sense.
openaire +1 more source
Acceptable solutions of linear complementarity problems
Computing, 1988zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A note on an open problem in linear complementarity
Mathematical Programming, 1977LetK be the class ofn × n matricesM such that for everyn-vectorq for which the linear complementarity problem (q, M) is feasible, then the problem (q, M) has a solution. Recently, a characterization ofK has been obtained by Mangasarian [5] in his study of solving linear complementarity problems as linear programs.
openaire +2 more sources
The Linear Complementarity Problem
1994This paper discusses a number of observations and conclusions drawn from ongoing research into more efficient algorithms for solving nonconvex linear complementarity problems (LCP). We apply interior point approaches and partitioning techniques to classes of problems that can be solved efficiently.
openaire +1 more source
The Linear Complementarity Problem
Journal of the London Mathematical Society, 1970openaire +2 more sources
New Convergence Results of the Modulus-Based Methods for Vertical Linear Complementarity Problems
Applied Mathematics Letters, 2023Hua Zheng, Xiaofei Peng
exaly
Characterization of Linear Complementarity Problems as Linear Programs
Mathematical Programming, 1978O L Mangasarian
exaly

