A polynomial-time algorithm for a class of linear complementarity problems (Q1123139): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Karmarkar's linear programming algorithm for problems in standard form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple computable bounds for solutions of linear complementarity problems and linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of complementary pivot methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / 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: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming / rank
 
Normal rank

Latest revision as of 10:00, 20 June 2024

scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for a class of linear complementarity problems
scientific article

    Statements

    A polynomial-time algorithm for a class of linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    polynomial-time algorithm
    0 references
    Karmarkar's algorithm
    0 references
    path of centers
    0 references