Sufficient matrices and the linear complementarity problem (Q1121805): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 04:00, 31 January 2024

scientific article
Language Label Description Also known as
English
Sufficient matrices and the linear complementarity problem
scientific article

    Statements

    Sufficient matrices and the linear complementarity problem (English)
    0 references
    0 references
    1989
    0 references
    A new class of matrices, related to the linear complementarity problem (LCP), the so called ``row sufficient'' matrices, are introduced. Respectively, the transpose of such a matrix is called ``column sufficient''. Two important results are proved: (i) A matrix \(M\) is row sufficient iff for every \(q\in \mathbb R^n\) any Kuhn-Tucker-point of the associated quadratic program solves the LCP \((q,M)\); (ii) \(M\) is column sufficient iff for every \(q\in \mathbb R^n\) the LCP \((q,M)\) has a convex solution set. The connections with other well-known matrix classes in linear complementarity theory are also discussed.
    0 references
    0 references
    row sufficient matrices
    0 references
    linear complementarity problem
    0 references
    column sufficient
    0 references