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

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10589-007-9112-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2064915245
@@ Property / OpenAlex ID: W2064915245 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321748
@@ Property / cites work: Q4321748 / rank @@
+Normal rank
@@ Property / cites work @@
+Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
+Normal rank
@@ Property / cites work @@
+Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Sparsity in sums of squares of polynomials
@@ Property / cites work: Sparsity in sums of squares of polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxations for semialgebraic problems
+Normal rank
@@ Property / cites work @@
+Q4285035
@@ Property / cites work: Q4285035 / rank @@
+Normal rank
@@ Property / cites work @@
+Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
+Normal rank