SPN completable graphs (Q269250): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complete positivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial results on completely positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3843714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible elements of the copositive cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completely positive and doubly nonnegative completion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of band matrices with band inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative factorization of positive semidefinite nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two remarks on copositive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On copositive matrices with -1, 9, 1 entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The copositive completion problem: unspecified diagonal entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The copositive completion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of completely positive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Matrix Equation <i>X</i>′<i>X</i> = <i>A</i> / rank
 
Normal rank

Latest revision as of 20:13, 11 July 2024

scientific article
Language Label Description Also known as
English
SPN completable graphs
scientific article

    Statements

    SPN completable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 April 2016
    0 references
    0 references
    completion problems
    0 references
    SPN matrices
    0 references
    copositive matrices
    0 references
    completely positive matrices
    0 references
    doubly nonnegative matrices
    0 references
    CP graphs
    0 references
    0 references