Separating doubly nonnegative and completely positive matrices (Q1942269): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computable representations for convex hulls of low-dimensional quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference between \(5\times 5\) doubly nonnegative and completely positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely positive matrices with a book-graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Linear Approximation Algorithm for Copositive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositivity cuts for improving SDP bounds on the clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonconvex Quadratic Programming with Box Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability / 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: Optimizing a polyhedral-semidefinite relaxation of completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(5 \times 5\) completely positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``\(5\times 5\) completely positive matrices'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3497912 / 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: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost copositive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach for nonconvex quadratic programming problems with box constraints / rank
 
Normal rank

Revision as of 07:35, 6 July 2024

scientific article
Language Label Description Also known as
English
Separating doubly nonnegative and completely positive matrices
scientific article

    Statements

    Separating doubly nonnegative and completely positive matrices (English)
    0 references
    0 references
    0 references
    18 March 2013
    0 references
    completely positive matrices
    0 references
    doubly nonnegative matrices
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references