Results 241 to 250 of about 3,215,324 (277)
Some of the next articles are maybe not open access.
Sparse Linear Complementarity Problems
2013In this paper, we study the sparse linear complementarity problem, denoted by k-LCP: the coefficient matrix has at most k nonzero entries per row. It is known that 1-LCP is solvable in linear time, while 3-LCP is strongly NP-hard. We show that 2-LCP is strongly NP-hard, while it can be solved in O(n 3 logn) time if it is sign-balanced, i.e., each row ...
Hanna Sumita +2 more
openaire +2 more sources
Convexification Techniques for Linear Complementarity Constraints
Journal of Global Optimization, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trang T. Nguyen +2 more
openaire +2 more sources
Linearized Methods for Tensor Complementarity Problems
Journal of Optimization Theory and Applications, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Bo Guan, Dong-Hui Li
openaire +2 more sources
Cycling in linear complementarity problems
Mathematical Programming, 1979A bound for the minimum length of a cycle in Lemke's Algorithm is derived. An example illustrates that this bound is sharp, and that the fewest number of variables is seven.
openaire +3 more sources
On Solution Stability of the Linear Complementarity Problem
Mathematics of Operations Research, 1992In the paper [5], C. D Ha introduced the notion of stability of a linear complementarity problem at a solution point and established several sufficient conditions for stability to hold. In the present paper, we derive some new stability results which significantly improve Ha's results.
M. Seetharama Gowda, Jong-Shi Pang
openaire +2 more sources
Integral Solutions of Linear Complementarity Problems
Mathematics of Operations Research, 1998We characterize the class of integral square matrices M having the property that for every integral vector q the linear complementarity problem with data M, q has only integral basic solutions. These matrices, called principally unimodular matrices, are those for which every principal nonsingular submatrix is unimodular. As a consequence, we show that
William H. Cunningham, James F. Geelen
openaire +2 more sources
Superfluous matrices in linear complementarity
Mathematical Programming, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Integer Solution for Linear Complementarity Problem
Mathematics of Operations Research, 1998We consider the problem of finding an integer solution to a linear complementarity problem. We introduce the class I of matrices for which the corresponding linear complementarity problem has an integer complementary solution for every vector, q, for which it has a solution.
R. Chandrasekaran +2 more
openaire +2 more sources
On the Solution Sets of Linear Complementarity Problems
SIAM Journal on Matrix Analysis and Applications, 2000The authors consider two problems related to the solution sets of linear complementarity problems of the following form \[ Az+ q\geq 0,\quad z\geq 0\quad\text{and}\quad z^t(Az+ q)= 0. \] For this problems, the connectedness and convexity of the solution sets is studied.
G. S. R. Murthy +2 more
openaire +1 more source
On the Parametric Linear Complementarity Problem
Journal of Optimization Theory and Applications, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source