On the complexity of computing the handicap of a sufficient matrix (Q644911): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Marianna. E.-Nagy / rank
Normal rank
 
Property / author
 
Property / author: Marianna. E.-Nagy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloptiPoly / rank
 
Normal rank
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.1007/s10107-011-0465-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066723173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5340130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sign reversing and matrix classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a subclass of \(P_ 0\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems / 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: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Co-NP-completeness of some matrix classification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ *\)-matrices are just sufficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the handicap of a sufficient matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming is in NP / rank
 
Normal rank

Latest revision as of 14:36, 4 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of computing the handicap of a sufficient matrix
scientific article

    Statements

    On the complexity of computing the handicap of a sufficient matrix (English)
    0 references
    0 references
    0 references
    7 November 2011
    0 references
    handicap of a sufficient matrix
    0 references
    linear complementarity problem (LCP)
    0 references
    semidefinite programming
    0 references
    0 references
    0 references

    Identifiers