Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems (Q5232243)

From MaRDI portal
Revision as of 12:52, 5 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127369854, #quickstatements; #temporary_batch_1722854988934)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7100202
Language Label Description Also known as
English
Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
scientific article; zbMATH DE number 7100202

    Statements

    Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 August 2019
    0 references
    0 references
    reachable set
    0 references
    discrete-time polynomial systems
    0 references
    polynomial optimization
    0 references
    semidefinite programming
    0 references
    moment relaxations
    0 references
    sums of squares
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references