A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q163016
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Kojima, Masakazu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-007-9112-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064915245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity in sums of squares of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones / 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: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / 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

Latest revision as of 01:19, 29 June 2024

scientific article
Language Label Description Also known as
English
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
scientific article

    Statements

    A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (English)
    0 references
    0 references
    0 references
    13 February 2009
    0 references
    Polynomial optimization problem
    0 references
    Conic program
    0 references
    Symmetric cone
    0 references
    Euclidean Jordan algebra
    0 references
    Sum of squares
    0 references
    Global optimization
    0 references
    Semidefinite program
    0 references

    Identifiers