Linear complementarity problem

Known as: LCP

In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

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

In this work we study the classical linear complementarity problem LCP by describing the asymptotic behavior of the approximate…

2000

In this article we consider two problems related to the solution sets of linear complementarity problems (LCPs)---one on the…

2000

Positive subdefinite matrices were introduced by Martos to characterize generalized convex quadratic functions. This concept is…

1998

We characterize the class of integral square matrices M having the property that for every integral vector q the linear…

1991

Convergence of iterates is established for a symmetric regular matrix splitting algorithm for the solution of the symmetric…

1983

This paper characterizes the classU of all realn×n matricesM for which the linear complementarity problem (q, M) has a unique…

Review

1981

Review

1981

Abstract : A large part of the study of the Linear Complementarity Problem (LCP) has been concerned with matrix classes. A…

1980

A variable dimension algorithm is presented for the linear complementarity problems − Mz = q; s,z ≥ 0; sizi = 0 fori = 1,2, ⋯ ,n…

1977

LetK be the class ofn × n matricesM such that for everyn-vectorq for which the linear complementarity problem (q, M) is feasible…