Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure (Q5245365)

From MaRDI portal
Revision as of 11:59, 20 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6423412
Language Label Description Also known as
English
Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
scientific article; zbMATH DE number 6423412

    Statements

    Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure (English)
    0 references
    0 references
    0 references
    8 April 2015
    0 references
    global optimization
    0 references
    nonlinear optimization
    0 references
    convex relaxation
    0 references
    convex optimization
    0 references
    complex optimization
    0 references
    quadratically constrained quadratic programs
    0 references
    semidefinite programming
    0 references
    second-order cone programming
    0 references
    graph theory
    0 references
    generalized weighted graph
    0 references
    power systems
    0 references
    optimal power flow
    0 references

    Identifiers

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