The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(93)90124-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982749624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive characterization ofQ o-matrices with nonnegative principal minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principal pivoting method revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two characterizations of sufficient matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient matrices and the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Method of Weighted Centers for Convex Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the criss-cross method for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and positive definiteness in oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite crisscross method for oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear quadratic programming in oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable dimension algorithm for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linear complementarity problems solvable in polynomial time / rank
 
Normal rank

Latest revision as of 18:44, 17 May 2024

scientific article
Language Label Description Also known as
English
The linear complementarity problem, sufficient matrices, and the criss- cross method
scientific article

    Statements

    The linear complementarity problem, sufficient matrices, and the criss- cross method (English)
    0 references
    29 August 1993
    0 references
    0 references
    \(P\)-matrices
    0 references
    linear complementarity problems
    0 references
    criss-cross method
    0 references
    bisymmetric matrices
    0 references
    oriented matroid programming problems
    0 references
    principal pivoting method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references