Computational complexity of LCPs associated with positive definite symmetric matrices (Q3854941): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone solutions of the parametric linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of complementary pivot methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of solutions to the complementarity problem and spanning properties of complementary cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Characterization of<i>P</i>-Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Alass of Complementary Cones and Lemke’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01588254 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997984350 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:46, 30 July 2024

scientific article
Language Label Description Also known as
English
Computational complexity of LCPs associated with positive definite symmetric matrices
scientific article

    Statements

    Computational complexity of LCPs associated with positive definite symmetric matrices (English)
    0 references
    0 references
    1979
    0 references
    positive definite symmetric matrices
    0 references
    linear complementarity
    0 references
    P-matrix
    0 references
    Lemke's algorithm
    0 references
    Gray code
    0 references

    Identifiers