On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046): Difference between revisions

@@ Property / cites work @@
+Regularizing the abstract convex program
@@ Property / cites work: Regularizing the abstract convex program / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760093
@@ Property / cites work: Q2760093 / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxation for nonconvex quadratic programs
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q4400639
@@ Property / cites work: Q4400639 / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
+Normal rank
@@ Property / cites work @@
+Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxation and nonconvex quadratic optimization
+Normal rank
@@ Property / cites work @@
+Strong Duality for Semidefinite Programming
@@ Property / cites work: Strong Duality for Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxations for the graph partitioning problem
+Normal rank
@@ Property / cites work @@
+Approximating quadratic programming with bound and quadratic constraints
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxations for the quadratic assignment problem
+Normal rank