Results 231 to 240 of about 3,215,324 (277)

On linear programs with linear complementarity constraints

Journal of Global Optimization, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jing Hu, John E. Mitchell 0001, Jong-Shi Pang, Bin Yu   +3 more
openaire   +2 more sources

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

Linear Complementarity Systems: Zeno States [PDF]

SIAM Journal on Control and Optimization, 2005
Conewise linear systems are dynamical systems in which the state space is partitioned into a finite number of nonoverlapping polyhedral cones on each of which the dynamics of the system is described by a linear differential equation. This class of dynamical systems represents a large number of piecewise linear systems, most notably, linear ...
Jong-shi Pang, Jinglai Shen
exaly   +3 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.
Jonathan M. Borwein, M. A. H. Dempster
openaire   +2 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

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

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

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

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