Exploiting sparsity in complex polynomial optimization (Q2073057): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Positive semidefinite matrices with a given sparsity pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming formulations for the alternating current optimal power flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of many rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase retrieval for imaging problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometric measure of multipartite entanglement and the singular values of a hypermatrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Roundoff Error Bounds Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind constant modulus equalization via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of purely complex μ computation and related problems in multidimensional systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting term sparsity in noncommutative polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity / rank
 
Normal rank

Revision as of 20:21, 27 July 2024

scientific article
Language Label Description Also known as
English
Exploiting sparsity in complex polynomial optimization
scientific article

    Statements

    Exploiting sparsity in complex polynomial optimization (English)
    0 references
    0 references
    0 references
    27 January 2022
    0 references
    complex moment-HSOS hierarchy
    0 references
    correlative sparsity
    0 references
    term sparsity
    0 references
    complex polynomial optimization
    0 references
    optimal power flow
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references