Results 251 to 260 of about 5,034,416 (318)

Modulus‐based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers

Numerical Linear Algebra with Applications, 2020
In this article, we generalize modulus‐based synchronous multisplitting methods to horizontal linear complementarity problems. In particular, first we define the methods of our concern and prove their convergence under suitable smoothness assumptions ...
F. Mezzadri
semanticscholar   +1 more source

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   +1 more source

On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of H+-matrices

Applied Mathematics and Computation, 2020
Horizontal linear complementarity problem has wide applications, such as in mechanical and electrical engineering, structural mechanics, piecewise linear system, telecommunication systems and so on.
Hua Zheng, Seakweng Vong
semanticscholar   +1 more source

Linear Complementarity Problem

Encyclopedia of Optimization, 2008
R. Cottle
openaire   +2 more sources

Note on error bounds for linear complementarity problems for B-matrices

Applied Mathematics Letters, 2016
Chaoqian Li, Yaotang Li
exaly   +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

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

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