Results 241 to 250 of about 105,781 (281)

Sparse Linear Complementarity Problems

2013
In 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, Naonori Kakimura, Kazuhisa Makino   +2 more
openaire   +1 more source

Complementarity problems in linear complementarity systems

Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207), 1998
Complementarity systems are described by differential and algebraic equations and inequalities similar to those appearing in the linear complementarity problem (LCP) of mathematical programming. Typical examples of such systems include mechanical systems subject to unilateral constraints, electrical networks with diodes, processes subject to relays and/
Heemels, W.P.M.H., Schumacher, J.M., Weiland, S.   +2 more
openaire   +3 more sources

Integer Solution for Linear Complementarity Problem

Mathematics of Operations Research, 1998
We 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, Santosh N. Kabadi, R. Sridhar   +2 more
openaire   +2 more sources

Cycling in linear complementarity problems

Mathematical Programming, 1979
A 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   +2 more sources

On the extended linear complementarity problem

Mathematical Programming, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Linearized Methods for Tensor Complementarity Problems

Journal of Optimization Theory and Applications, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Bo Guan, Dong-Hui Li
openaire   +2 more sources

Linear complementarity problems and bi-linear games

Applications of Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sengodan, Gokulraj, Arumugasamy, Chandrashekaran   +1 more
openaire   +2 more sources

On the Parametric Linear Complementarity Problem

Journal of Optimization Theory and Applications, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Degeneracy in linear complementarity problems: a survey

Annals of Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Integral Solutions of Linear Complementarity Problems

Mathematics of Operations Research, 1998
We 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