Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337)

From MaRDI portal
Revision as of 10:26, 2 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
Solving polynomial least squares problems via semidefinite programming relaxations
scientific article

    Statements

    Solving polynomial least squares problems via semidefinite programming relaxations (English)
    0 references
    0 references
    0 references
    25 January 2010
    0 references
    0 references
    polynomial second-order cone programs
    0 references
    sparsity
    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