On the solution of NP-hard linear complementarity problems (Q699514): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An implicit enumeration procedure for the general linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Level Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual trust-region algorithm for non-convex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental investigation of enumerative methods for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of LCP methods for bilinear and concave quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution and complexity of a generalized linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for solving bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear complementarity problem as a separable bilinear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding stationary points of nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration approach for linear complementarity problems based on a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point algorithm for nonconvex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank

Latest revision as of 16:30, 4 June 2024

scientific article
Language Label Description Also known as
English
On the solution of NP-hard linear complementarity problems
scientific article

    Statements

    On the solution of NP-hard linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 September 2002
    0 references
    mathematical programming
    0 references
    complementarity
    0 references
    global optimization
    0 references
    enumerative algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers