A simplex algorithm for rational cp-factorization (Q2020599)

From MaRDI portal
Revision as of 14:21, 25 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simplex algorithm for rational cp-factorization
scientific article

    Statements

    title
    A simplex algorithm for rational cp-factorization (English)
    0 references
    author
    Achill Schürmann
    0 references
    Frank Vallentin
    0 references
    publication date
    23 April 2021
    0 references
    zbMATH Keywords
    copositive programming
    0 references
    complete positivity
    0 references
    matrix factorization
    0 references
    copositive minimum
    0 references
    cites work
    GitHub
    0 references
    Q4039784
    0 references
    Q3497912
    0 references
    Q4789130
    0 references
    Q3818127
    0 references
    Q5302597
    0 references
    Q5146244
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C20
    0 references
    11H50
    0 references
    11H55
    0 references
    zbMATH DE Number
    7337504
    0 references
    OpenAlex ID
    W3104369750
    0 references
    arXiv ID
    1807.01382
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2020599&oldid=36672448"
    Powered by MediaWiki