Results 251 to 260 of about 105,781 (281)

On the Solution Sets of Linear Complementarity Problems

SIAM Journal on Matrix Analysis and Applications, 2000
The 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, T. Parthasarathy, B. Sriparna   +2 more
openaire   +1 more source

Equivalence of the Generalized Vertical Block Linear Complementarity Problems and Linear Complementarity Problems

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, Sudarshan Nanda, Mahendra Prasad Biswal   +2 more
openaire   +1 more source

The Linear Complementarity Problem

1994
This 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

Newton's method for linear complementarity problems

Mathematical Programming, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

NP-Completeness of the linear complementarity problem

Journal of Optimization Theory and Applications, 1989
We 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

A note on an open problem in linear complementarity

Mathematical Programming, 1977
LetK 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

Journal of the London Mathematical Society, 1970
openaire   +2 more sources

The linear complementarity problem

Mathematics and Computers in Simulation, 1992
W.F. Ames, C. Brezinski
openaire   +1 more source

Monotone solutions of the parametric linear complementarity problem

Mathematical Programming, 1972
Richard W Cottle
exaly  

Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices

SIAM Journal on Optimization, 1997
Masakazu Kojima, Shinji Hara
exaly