Skip to search formSkip to main contentSkip to account menu

Linear complementarity problem

Known as: LCP 
In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Complementarity theoryComputational mechanicsCriss-cross algorithmGempack

Broader (1)

Linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A New Interior Point Method for Linear Complementarity Problem
For a given n-vector q and a real square matrix M ∈ IR n×n , the linear complementarity problem, denoted LCP(M,q), is that of… 
2005
2005
The Linear Complementarity Problem Under Asymptotic Analysis
In this work we study the classical linear complementarity problem LCP by describing the asymptotic behavior of the approximate… 
2002
2002
Some New Results for the Semidefinite Linear Complementarity Problem
In this paper, we present some new results for the semidefinite linear complementarity problem (SDLCP). In the first part, we… 
2000
2000
On the Solution Sets of Linear Complementarity Problems
In this article we consider two problems related to the solution sets of linear complementarity problems (LCPs)---one on the… 
2000
2000
Positive Subdefinite Matrices, Generalized Monotonicity, and Linear Complementarity Problems
Positive subdefinite matrices were introduced by Martos to characterize generalized convex quadratic functions. This concept is… 
1998
1998
Integral Solutions of Linear Complementarity Problems
We characterize the class of integral square matrices M having the property that for every integral vector q the linear… 
1994
1994
The Linear Complementarity Problem with Exact Order Matrices
Dedicated to Professor K. G. Ramamurthy on the occasion of his 60th birthday. A real n by n matrix A is called an NP-matrix of… 
Review
1981
Review
1981
Geometric aspects of the linear complementarity problem
Abstract : A large part of the study of the Linear Complementarity Problem (LCP) has been concerned with matrix classes. A… 
1980
1980
A variable dimension algorithm for the linear complementarity problem
A variable dimension algorithm is presented for the linear complementarity problems − Mz = q; s,z ≥ 0; sizi = 0 fori = 1,2, ⋯ ,n… 
1977
1977
A note on an open problem in linear complementarity
LetK be the class ofn × n matricesM such that for everyn-vectorq for which the linear complementarity problem (q, M) is feasible… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)