Results 231 to 240 of about 8,709,898 (283)

The Generalized Order Linear Complementarity Problem

SIAM Journal on Matrix Analysis and Applications, 1994
The generalized order linear complementarity problem (in the setting of a finite dimensional vector lattice) is the problem of finding a solution to the piecewise-linear system \[ x \wedge ( M_1 x + q_1 ) \wedge ( M_2 x + q_2 ) \wedge \cdots \wedge ( M_k x + q_k ) = 0, \] where $M_i $’s are linear transformations and $q_i $’s are vectors.
M. Seetharama Gowda, Roman Sznajder
openaire   +5 more sources

On the extended linear complementarity problem

Mathematical Programming, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Seetharama Gowda
openaire   +4 more sources

The Linear Order Complementarity Problem

Mathematics of Operations Research, 1989
The classical complementarity problem in Euclidean space can be viewed alternatively as a variational inequality or as a lattice orthogonality problem. Generalizations of the former have been extensively studied, but infinite-dimensional analogues of the latter have been largely ignored. Moreover, as we show, many well-known results about the classical
Jonathan M. Borwein, M. A. H. Dempster
openaire   +2 more sources

Generalized linear complementarity problems

Mathematical Programming, 1990
The generalization is twofold. First, the problem is defined for closed convex cones rather than for the non-negative orthant. Second, some, but not all, the results are stated for infinite-dimensional real Hilbert spaces. Two infinite-dimensional existence results are given.
M. Seetharama Gowda, Thomas I. Seidman
openaire   +2 more sources

On semidefinite linear complementarity problems

Mathematical Programming, 2000
The paper deals with the SemiDefinite Linear Complementarity Problem (SDLCP\((L,S^n_+)\): find a matrix \(X \in S^n_+\) such that \(Y=L(x)+Q \in S^n_+\) and and \(\langle X,Y\rangle=0\), where \(S^n\) (\(S^n_+\)) denote the set of symmetric (positive semidefinite) matrices, \(L: S^n \rightarrow S^n\) is a linear transformation, \(Q \in S^n\) and ...
M. Seetharama Gowda, Yoon J. Song
openaire   +3 more sources

On the Linear Complementarity Problem

Management Science, 1975
Consider the linear complementarity problem given in the system: [Formula: see text] where, W, Z and q are vectors of dimension n. M is a matrix of order n × n and ZT is the transpose of Z. Any (Z, W) satisfying (1), (2), and (3) is a complementary feasible solution to system (I).
openaire   +2 more sources

The Linear Complementarity Problem

Management Science, 1971
This study centers on the task of efficiently finding a solution of the linear complementarity problem: Ix − My = q, x ≥ 0, y ≥ 0, x ⊥ y. The main results are: (1) It is shown that Lemke's algorithm will solve (or show no solution exists) the problem for M ∈ L where L is a class of matrices, which properly includes (i) certain copositive matrices, (ii)
openaire   +2 more sources

Generalized Linear Complementarity Problems

Mathematics of Operations Research, 1995
We introduce the concept of the generalized (monotone) linear complementarity problem (GLCP) in order to unify LP, convex QP, monotone LCP, and mixed monotone LCP. We establish the basic properties of GLCP and develop canonical forms for its representation. We show that the GLCP reduces to a monotone LCP in the same variables.
openaire   +2 more sources

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   +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