Pages that link to "Item:Q1001199"
From MaRDI portal
The following pages link to A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199):
Displayed 8 items.
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Positive polynomials on projective limits of real algebraic varieties (Q998968) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Positive polynomials on fibre products (Q2370796) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)