Sublinear circuits and the constrained signomial nonnegativity problem (Q2687052)

From MaRDI portal
Revision as of 18:30, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sublinear circuits and the constrained signomial nonnegativity problem
scientific article

    Statements

    title
    Sublinear circuits and the constrained signomial nonnegativity problem (English)
    0 references
    author
    Riley Murray
    0 references
    Helen Naumann
    0 references
    Thorsten Theobald
    0 references
    publication date
    1 March 2023
    0 references
    zbMATH Keywords
    sums of arithmetic-geometric exponentials
    0 references
    positive signomials
    0 references
    exponential sums
    0 references
    sums of nonnegative circuit polynomials (SONC)
    0 references
    positive polynomials
    0 references
    multiplicative convexity
    0 references
    log convex sets
    0 references
    describes a project that uses
    REPOP
    0 references
    Sageopt
    0 references
    cites work
    Q5005186
    0 references
    Q4293510
    0 references
    Q3395491
    0 references
    Q4235027
    0 references
    Q4861423
    0 references
    Lectures on Polytopes
    0 references

    Identifiers

    Mathematics Subject Classification ID
    14P05
    0 references
    90C23
    0 references
    90C30
    0 references
    05B35
    0 references
    52A20
    0 references
    zbMATH DE Number
    7658256
    0 references
    OpenAlex ID
    W3100197943
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2687052&oldid=39197199"
    Powered by MediaWiki