Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658)

From MaRDI portal
Revision as of 22:26, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
scientific article

    Statements

    Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    polynomial optimization
    0 references
    sparse sum-of-squares hierarchy
    0 references
    semi-definite programming
    0 references
    pooling problem
    0 references
    chordal sparsity structure
    0 references
    discrete-time optimal control
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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